Complexity and randomness in the Heisenberg groups (and beyond)
From MaRDI portal
Publication:3380361
DOI10.53733/134zbMath1473.05283arXiv2107.02923OpenAlexW3200515403MaRDI QIDQ3380361
Persi Diaconis, Maryanthe Malliaris
Publication date: 28 September 2021
Published in: New Zealand Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.02923
Related Items (5)
Word automatic groups of nilpotency class 2 ⋮ A random walk on the Rado graph ⋮ Isomorphisms between random graphs ⋮ Limit theorems for distributions invariant under groups of transformations ⋮ Double coset Markov chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotically optimal induced universal graphs
- Superclasses and supercharacters of normal pattern subgroups of the unipotent upper triangular matrix group.
- Supercharacters, symmetric functions in noncommuting variables, and related Hopf algebras
- Extraspecial p-groups
- Classification theory and the number of non-isomorphic models
- A super-class walk on upper-triangular matrices
- Basic characters of the unitriangular group
- An exercise(?) in Fourier analysis on the Heisenberg group
- Counting characters of upper triangular groups.
- On the p -Length of p -Soluble Groups and Reduction Theorems for Burnside's Problem
- Enumerating p -Groups. I: Inequalities
- The Number of Trace-Valued Forms and Extraspecial Groups
- On the role of the Heisenberg group in harmonic analysis
- Random walk on unipotent matrix groups
- One-dimensional asymptotic classes of finite structures
- Endliche Gruppen I
- On some problems of a statistical group-theory. IV
- The strange logic of random graphs
This page was built for publication: Complexity and randomness in the Heisenberg groups (and beyond)
