Groups, graphs, and hypergraphs : average sizes of kernels of generic matrices with support constraints
Author(s)
Bibliographic Information
Groups, graphs, and hypergraphs : average sizes of kernels of generic matrices with support constraints
（Memoirs of the American Mathematical Society, no. 1465）
American Mathematical Society, c2024
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
"February 2024, volume 294, number 1465 (second of 5 numbers)"
Includes bibliographical references (p. 117-120)
Description and Table of Contents
Description
We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish strong uniformity results pertaining to zeta functions enumerating conjugacy classes of these groups. We deduce that the numbers of conjugacy classes of Fq-points of the groups under consideration depend polynomially on q. Our approach combines group theory, graph theory, toric geometry, and p-adic integration.
Our uniformity results are in line with a conjecture of Higman on the numbers of conjugacy classes of unitriangular matrix groups. Our findings are, however, in stark contrast to related results by Belkale and Brosnan on the numbers of generic symmetric matrices of given rank associated with graphs.
Table of Contents
1. Introduction
2. Ask zeta functions and modules over polynomial rings
3. Modules and module representations from (hyper)graphs
4. Modules over toric rings and associated zeta functions
5. Ask zeta functions of hypergraphs
6. Uniformity for ask zeta functions of graphs
7. Graph operations and ask zeta functions of cographs
8. Cographs, hypergraphs, and cographical groups
9. Further examples
10. Open problems
by "Nielsen BookData"