Complexity and randomness in the Heisenberg groups (and beyond)

@article{Diaconis2021ComplexityAR,
  title={Complexity and randomness in the Heisenberg groups (and beyond)},
  author={Persi Diaconis and Maryanthe Malliaris},
  journal={New Zealand Journal of Mathematics},
  year={2021}
}
By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups $H_{2n+1}(p)$ and their limit $H_\infty(p)$ we find pseudo-random behavior (and the random graph in the limiting case). This makes a nice case study for transfer of information between finite and infinite objects. Some of this behavior transfers to the problem of understanding what makes understanding the character theory of the uni-upper-triangular group (mod p) “wild.” Our investigations in this paper… Expand

Figures from this paper

Isomorphisms between random graphs
Consider two independent Erdős–Rényi G(N, 1/2) graphs. We show that with probability tending to 1 as N → ∞, the largest induced isomorphic subgraph has size either ⌊xN − εN⌋ or ⌊xN + εN⌋, where xN =Expand

References

SHOWING 1-10 OF 51 REFERENCES
On the role of the Heisenberg group in harmonic analysis
In this article I want to popularize the Heisenberg group, which is remarkably little known considering its ubiquity. I use the word ubiquity advisedly. To justify it, let me give a sample of theExpand
Do infinite nilpotent groups always have equipotent Abelian subgroups
$ 1. INTRODUCTION In 14; Theorem 31, it was shown that every infinite ZPC-group G (this class of groups includes both FC-groups and nilpotent groups) has an abelian subgroup A such that exp IAl >Expand
ON HIGMAN’S k(Un(q)) CONJECTURE
A classical conjecture by Graham Higman states that the number of conjugacy classes of Un(q), the group of upper triangular n × n matrices over Fq, is polynomial in q, for all n. In this paper weExpand
Counting characters of upper triangular groups
Abstract Working over a finite field of order q, let U n ( q ) be the group of upper triangular n × n matrices with all diagonal entries equal to 1. It is known that all complex irreducibleExpand
Random walk on unipotent matrix groups
We introduce a new method for proving central limit theorems for random walk on nilpotent groups. The method is illustrated in a local central limit theorem on the Heisenberg group, weakening theExpand
Finite Structures with Few Types
I will report on joint work with G. Cherlin on the quasi-finite axiomatizability of smoothly approximable structures, and on finite structures with few types. Let L be a finite language, k anExpand
An Exercise (?) in Fourier Analysis on the Heisenberg Group
Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. TheExpand
Natural quasirandomness properties
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc.Expand
Large Networks and Graph Limits
The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of theExpand
ON THE COMMUTING PROBABILITY IN FINITE GROUPS
For Bernd Fischer on the occasion of his 70th birthdayIntroduction: When Gis a nite group, we may endow G Gwith the structureof a probability space by assigning the uniform distribution. As wasExpand
...
1
2
3
4
5
...