Sandpile Groups of Cayley Graphs of \mathbb{F}_2r

MaRDI QIDQ6504929arXivFDO

Authors Jiyang Gao, Jared Marx-Kuo, Vaughan McDonald, Chi Ho Yuen

Published in arXiv

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)

Abstract: The sandpile group of a connected graph $G$, defined to be the torsion part of the cokernel of the graph Laplacian, is a subtle graph invariant with combinatorial, algebraic, and geometric descriptions. Extending and improving previous works on the sandpile group of hypercubes, we study the sandpile groups of the Cayley graphs of $mathbb{F}_2^r$, focusing on their poorly understood Sylow-$2$ component. We find the number of Sylow-$2$ cyclic factors for "generic" Cayley graphs and deduce a bound for the non-generic ones. Moreover, we provide a sharp upper bound for their largest Sylow-$2$ cyclic factors. In the case of hypercubes, we give exact formulae for the largest $n-1$ Sylow-$2$ cyclic factors. Some key ingredients of our work include the natural ring structure on these sandpile groups, and calculation of the $2$-adic valuations of binomial sums via the combinatorics of carries.

This page was built for publication: Sandpile Groups of Cayley Graphs of $\mathbb{F}_2^r$

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