Search arXivSearch

arXiv · 2609.10625

The 2-Adic Valuation of the Order of the All-Ones Class in the Sandpile Group of a Square

Abstract

Place one grain at every nonsink vertex of the wired $n\times n$ square, and let $L(n)$ be the order of this operation in the sandpile group. Thus $L(n)$ is the least positive $q$ for which $q$ uniform grain layers form an integral combination of toppling moves. We prove that, for every $n\ge1$, \[ ν_2(L(n))= \begin{cases} 2,&n=1,\\ 1,&n\ge2\text{ even},\\ ν_2(n+1)+2,&n\ge3\text{ odd}. \end{cases} \] For even squares, this follows from the domino--sandpile results of Florescu, Morar, Perkinson, Salter, and Xu, completed by a short parity observation. For odd squares, a unimodular cyclic basis identifies the folded cokernel with a quotient by two shifted Chebyshev polynomials and sends the all-ones class to $1$. Its order is determined by the constant part of this polynomial ideal, not just by a determinant. Two normalized Euclidean remainders reduce to consecutive Fibonacci polynomials over $\mathbb F_2$, giving the exact valuation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Turgay Akyar, Artem Beliakov, Konstantin Delchev, Nikita Kalinin, Ernesto Lupercio, Higinio Serrano, Mikhail Shkolnikov, Daniel Tabares, Nikolai Terekhov. 2026-09-09. The 2-Adic Valuation of the Order of the All-Ones Class in the Sandpile Group of a Square. https://arxiv.org/abs/2609.10625

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO