The diagonal graph

MaRDI QIDQ5036309zbMATH OpenFDO

Authors R. A. Bailey, Peter J. Cameron

Publication date 23 February 2022

Full work available at URL https://arxiv.org/abs/2101.02451, http://www.mathjournals.org/jrms/2021-036-004/2021-036-004-011.html

zbMATH Keywords

Cartesian latticediagonal groupsO'Nan-Scott theoremwreath product of symmetric groups

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Permutation groups (20B99) Simple groups: sporadic groups (20D08) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a much larger class than those occurring in this theorem. For any positive integer $m$ and group $G$ (finite or infinite), there is a diagonal semilattice, a sub-semilattice of the lattice of partitions of a set $Omega$, whose automorphism group is the corresponding diagonal group. Moreover, there is a graph (the diagonal graph), bearing much the same relation to the diagonal semilattice and group as the Hamming graph does to the Cartesian lattice and the wreath product of symmetric groups. Our purpose here, after a brief introduction to this semilattice and graph, is to establish some properties of this graph. The diagonal graph $Gamm{a}_D(G,m)$ is a Cayley graph for the group~$G^m$, and so is vertex-transitive. We establish its clique number in general and its chromatic number in most cases, with a conjecture about the chromatic number in the remaining cases. We compute the spectrum of the adjacency matrix of the graph, using a calculation of the M"obius function of the diagonal semilattice. We also compute some other graph parameters and symmetry properties of the graph. We believe that this family of graphs will play a significant role in algebraic graph theory.

Recommendations

• Graphs represented by extended diagonal matrices
• The diagonal of the associahedra
• scientific article; zbMATH DE number 1743761
• scientific article; zbMATH DE number 3865304
• Diatonic graphs
• The graph of acyclic digraphs
• The Conway Gordian graph
• The underlying graph of a line digraph
• Triangular graphs represented by extended diagonal matrices
• Rectangular diagrams of Legendrian graphs

Cites work

• Complete mappings of finite groups
• Complete mappings of finite groups
• Design of Comparative Experiments
• Factorial design and Abelian groups
• scientific article; zbMATH DE number 3717558 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• On the chromatic number of cube-like graphs
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Orthogonal partitions in designed experiments
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• The admissibility of sporadic simple groups.
• The chromatic number of finite group Cayley tables
• The geometry of diagonal groups
• The Hall-Paige conjecture, and synchronization for affine and diagonal groups
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme

Cited in

(3)

• On the diagonals
• Diagonal groups and arcs over groups
• The geometry of diagonal groups

Describes a project that uses

Uses Software

• GAP

This page was built for publication: The diagonal graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036309)