Complexity and randomness in the Heisenberg groups (and beyond)
-
Published:2021-09-19
Issue:
Volume:52
Page:403-426
-
ISSN:1179-4984
-
Container-title:New Zealand Journal of Mathematics
-
language:
-
Short-container-title:NZ J Math
Author:
Diaconis Persi,Malliaris Maryanthe
Abstract
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 may be seen as a meditation on the question: is randomness simple or is it complicated?
Publisher
New Zealand Journal of Mathematics Committee
Subject
Applied Mathematics,Geometry and Topology,Algebra and Number Theory,Analysis
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献