arXiv Analytics

Sign in

arXiv:1405.0113 [math.CO]AbstractReferencesReviewsResources

Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields

Swee Hong Chan, Henk D. L. Hollmann, Dmitrii V. Pasechnik

Published 2014-05-01Version 1

A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a finite group $\mathbb{Z}^{n-1}/\mathbb{Z}^{n-1}M$ known as the sandpile (or critical) group $S(\Gamma)$ of $\Gamma$. We determine $S(\Gamma)$ of the generalized de Bruijn graphs $\Gamma=\mathrm{DB}(n,d)$ with vertices $0,\dots,n-1$ and arcs $(i,di+k)$ for $0\leq i\leq n-1$ and $0\leq k\leq d-1$, and closely related generalized Kautz graphs, extending and completing earlier results for the classical de Bruijn and Kautz graphs. Moreover, for a prime $p$ and an $n$-cycle permutation matrix $X\in\mathrm{GL}_n(p)$ we show that $S(\mathrm{DB}(n,p))$ is isomorphic to the quotient by $\langle X\rangle$ of the centralizer of $X$ in $\mathrm{PGL}_n(p)$. This offers an explanation for the coincidence of numerical data in sequences A027362 and A003473 of the OEIS, and allows one to speculate upon a possibility to construct normal bases in the finite field $\mathbb{F}_{p^n}$ from spanning trees in $\mathrm{DB}(n,p)$.

Related articles: Most relevant | Search more
arXiv:math/0612331 [math.CO] (Published 2006-12-12, updated 2008-09-03)
The minimum rank problem over the finite field of order 2: minimum rank 3
arXiv:math/0606005 [math.CO] (Published 2006-05-31)
Free Arrangements over Finite Field
arXiv:0804.3074 [math.CO] (Published 2008-04-18, updated 2009-06-16)
(q,t)-analogues and GL_n(F_q)