Abelian coverings of finite general linear groups and an application to their non-commuting graphs.
DOI10.1007/s10801-011-0288-2zbMath1236.20022arXiv1004.3402WikidataQ56987625 ScholiaQ56987625MaRDI QIDQ644701
Azizollah Azad, Mohammad A. Iranmanesh, Pablo Spiga, Cheryl E. Praeger
Publication date: 7 November 2011
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.3402
Abelian subgroups; finite general linear groups; clique numbers; coverings of groups; cyclic matrices; non-commuting graphs
20G40: Linear algebraic groups over finite fields
20D60: Arithmetic and combinatorial problems involving abstract finite groups
20D30: Series and lattices of subgroups
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05A16: Asymptotic enumeration
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal covers of \(S_ n\) by Abelian subgroups and maximal subsets of pairwise noncommuting elements
- Some applications of graph theory to finite groups
- Non-commuting graph of a group.
- The Number of Pairwise Non-Commuting Elements and the Index of the Centre in a Finite Group
- Groups covered by finitely many cosets or subgroups
- Coverings of Groups by Abelian Subgroups
- Cycle indices for the finite classical groups
- The number of subgroups with trivial unipotent radicals in finite groups of Lie type
- On non-commuting sets in an extraspecial p-group
- Counting cyclic and separable matrices over a finite field
- Cyclic Matrices Over Finite Fields
- MAXIMAL SUBSETS OF PAIRWISE NONCOMMUTING ELEMENTS OF THREE-DIMENSIONAL GENERAL LINEAR GROUPS
- A generating function approach to the enumeration of matrices in classical groups over finite fields
- Maximal Abelian Subgroups of the Symmetric Groups