Search arXivSearch

arXiv · 2504.05275

On Canonical Sandpile Actions of Embedded Graphs

Abstract

The sandpile group of a connected graph is a group whose cardinality is the number of spanning trees. The group is known to have a canonical simply transitive action on spanning trees if the graph is embedded into the plane. However, no canonical action on the spanning trees was known for the nonplanar case. We show that for any embedded Eulerian digraph, one can define a canonical simply transitive action of the sandpile group on compatible Eulerian tours (a set whose cardinality equals the number of spanning arborescences). This enables us to give a new proof that the rotor-routing action of a ribbon graph is independent of the root if and only if the embedding is into the plane (originally proved by Chan, Church and Grochow). Recently, Merino, Moffatt and Noble defined a sandpile group variant (called Jacobian) for embedded graphs, whose cardinality is the number of quasi-trees. Baker, Ding and Kim showed that this group acts canonically on the quasi-trees. We show that the Jacobian of an embedded graph is the usual sandpile group of the medial digraph, and the action by Baker et al. agrees with the action of the sandpile group of the medial digraph on Eulerian tours (which fact is made possible by the existence of a canonical bijection between Eulerian tours of the medial digraph and quasi-trees due to Bouchet).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lilla Tóthmérész. 2026-07-31. On Canonical Sandpile Actions of Embedded Graphs. https://doi.org/10.19086/aic.2026.6

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