The Coloured Sand Theorem: the p-part of the sandpile group of the Hamming graph, for every prime p dividing q and every dimension d
Version 1 / Oct 15, 2026 / CC BY 4.0
Abstract
Let be the Hamming graph and its sandpile group (critical group, Jacobian). For primes its -part was determined by Jacobson, Niedermaier and Reiner in 2003, who wrote that the other primes appear "to be difficult, due to bad behavior of its -primary structure". We determine the Sylow -subgroup of for every prime dividing and every , by an explicit rule. After the splitting of Jacobson, Niedermaier and Reiner, the group is a sum of cokernels of operators on the Boolean lattice (Theorem A). These split over the indecomposable tilting modules of in characteristic that occur in a tensor power of the natural module. The contribution of consists of explicit small cyclic factors and of large ones, where is the set of positions of the nonzero base- digits of below the leading one. The large ones are obtained by pooling explicit integers, built from binomial valuations and base- carries, into a non-increasing sequence (Theorems I and J). The proof writes down explicit -lattices for all tilting modules of , one move per base- digit; it reduces each contribution to the Smith form of an explicit matrix, and computes that form as in our proof for the hypercube (The Dancing Sand Theorem), the case . We also give closed formulas that need no pooling: for with ballot numbers (B), for the exponent with every prime (C), and for the number of cyclic factors (D). This proves Conjecture I of version 3 of this paper. Every result of the paper, Theorems A–J, is checked in Lean 4 with Mathlib, for every prime, and the Lean project was rebuilt from its sources on GitHub's machines, on Mathlib's published build. This work has not been refereed by a human expert.
Provenance statement
AI provenance filesHOW_THE_COLOURED_SAND_WAS_BUILT.md · 4 KB
Tools used
- Anthropic
- Claude Code
- Lean
- LeanVersion v4.28.0 (with Mathlib)
- SageMath
- SageMath
- Harmonic
- Aristotle
- Python Software Foundation
- Python 3 (NumPy)
References
- H. H. Andersen, Filtrations and tilting modules, Ann. Sci. Éc. Norm. Supér. (4) 30 (1997), 353--366.
- H. Bai, On the critical group of the -cube, Linear Algebra Appl. 369 (2003), 251--261.
- N. L. Biggs, Chip-firing and the critical group of a graph, J. Algebraic Combin. 9 (1999), 25--45.
- D. B. Chandler, P. Sin, Q. Xiang, The Smith group of the hypercube graph, arXiv:1511.00272.arXiv
- J. E. Ducey, J. Gerhard, N. Watson, The Smith and critical groups of the square rook's graph and its complement, Electron. J. Combin. 23(4) (2016), #P4.9; arXiv:1507.06583.arXiv
- J. E. Ducey, D. M. Jalil, Integer invariants of abelian Cayley graphs, Linear Algebra Appl. 445 (2014), 316--325; arXiv:1308.2335.arXiv
- S. Donkin, On tilting modules for algebraic groups, Math. Z. 212 (1993), 39--60.
- R. Amichis Luengo, The Dancing Sand Theorem: the 2-part of the sandpile group of the hypercube, for every , preprint (2026), version 11, hexagon:2610.00205; concept DOI 10.5281/zenodo.23188298 (all versions), version 11 10.5281/zenodo.23356712. Its proof is checked in Lean 4; Lean certificate: doi:10.5281/zenodo.23298436.hexagonDOI
- Harmonic, Aristotle, https://aristotle.harmonic.fun.link
- J. C. Jantzen, Representations of Algebraic Groups , 2nd ed., Math. Surveys Monogr. 107, Amer. Math. Soc., 2003.
Show all 14 referencesShow fewer references
- B. Jacobson, A. Niedermaier, V. Reiner, Critical groups for complete multipartite graphs and Cartesian products of complete graphs, J. Graph Theory 44 (2003), 231--250.
- R. A. Proctor, Representations of on posets and the Sperner property, SIAM J. Algebraic Discrete Methods 3 (1982), 275--280.
- L. Sutton, D. Tubbenhauer, P. Wedrich, J. Zhu, tilting modules in the mixed case, Selecta Math. (N.S.) 29 (2023); arXiv:2105.07724.arXiv
- R. M. Wilson, A diagonal form for the incidence matrices of -subsets vs.\ -subsets, European J. Combin. 11 (1990), 609--615.
Version history
- v1 · 24 pagesSubmitted by Rafael Amichis LuengoInitial depositCurrentOct 15, 2026