Advertisement

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

  • Swee Hong Chan
  • Henk D. L. Hollmann
  • Dmitrii V. Pasechnik
Part of the CRM Series book series (PSNS, volume 16)

Abstract

We determine the critical groups of the generalized de Bruijn graphs DB(n, d) and generalized Kautz graphs Kautz (n, d), thus extending and completing earlier results for the classical de Bruijn and Kautz graphs. Moreover, for a prime p the critical groups of DB(n, p) are shown to be in close correspondence with groups of n × n circulant matrices over Fp, which explains numerical data in [11] and suggests the possibility to construct normal bases in Fp n from spanning trees in DB(n, p).

Keywords

Normal Basis Critical Group Circulant Matrix Integral Matrix Circulant Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. A. Alfaro and C. E. Valencia, On the sandpile group of the cone of a graph, Linear Algebra and its Applications 436(5) (2012), 1154–1176.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    J. Arndt, “Matters Computational: Ideas, Algorithms, Source Code”, Springer, 2010, http://www.jjj.de/fxt/fxtbook.pdf.
  3. [3]
    H. Bidkhori and S. Kishore, A bijective proof of a theorem of Knuth, Comb. Probab. Comput. 20(1) (2010), 11–25.CrossRefMathSciNetGoogle Scholar
  4. [4]
    D.-Z. Du, F. Cao and D. F. Hsu, De Bruijn digraphs, Kautz digraphs, and their generalizations, In: “Combinatorial Network Theory” D.-Z. Du and D. F. Hsu (eds.), Kluwer Academic, 1996, 65–105.Google Scholar
  5. [5]
    S. Duzhin and D. Pasechnik, Automorphisms of necklaces and sandpile groups, 2013. http://arxiv.org/abs/1304.2563.
  6. [6]
    A. E. Holroyd, L. Levine, K. Mészáros, Y. Peres, J. Propp and D. B. Wilson, Chip-firing and rotor-routing on directed graphs, In: “In and out of equilibrium. 2”, volume 60 of Progr. Probab., Birkhäuser, Basel, 2008, 331–364.Google Scholar
  7. [7]
    M. Imase and M. Itoh, A design for directed graphs with minimum diameter, Computers, IEEE Transactions on C-32(8) (1983), 782–784.CrossRefGoogle Scholar
  8. [8]
    L. Levine, Sandpile groups and spanning trees of directed line graphs, J. Combin. Theory Ser. A118(2) (2011), 350–364.CrossRefGoogle Scholar
  9. [9]
    R. Lidl and H. Niederreiter, “Finite Fields”, volume 20 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, second edition, 1997.Google Scholar
  10. [10]
    M. Newman, “Integral Matrices” Number v. 45 in Pure and Applied Mathematics — Academic Press. Acad. Press, 1972.Google Scholar
  11. [11]
    The on-line encyclopedia of integer sequences, entry A027362, 2004–2011. see http://www.oeis.org/A027362/A027362.
  12. [12]
    D. Perkinson, “Sage Sandpiles”, 2012. see http://www.people.reed.edu/davidp/sand/sage/sage.html/davidp/sand/sage/sage.html.
  13. [13]
    C. Reutenauer, “Free Lie Algebras”, Oxford University Press, 1993.Google Scholar
  14. [14]
    J. J. Rushanan, “Topics in Integral Matrices and Abelian Group Codes”, ProQuest LLC, Ann Arbor, MI, 1986. Thesis (Ph.D.) — California Institute of Technology.Google Scholar
  15. [15]
    W. Stein et al., “Sage Mathematics Software” (Version 5.7), The Sage Development Team, 2012. http://www.sagemath.org.
  16. [16]
    D. Wagner, “The critical Group of a Directed Graph”, 2000. Available at http://www.arxiv.org/abs/math/0010241/abs/math/0010241.

Copyright information

© Scuola Normale Superiore Pisa 2013

Authors and Affiliations

  • Swee Hong Chan
    • 1
  • Henk D. L. Hollmann
    • 1
  • Dmitrii V. Pasechnik
    • 1
  1. 1.School of Physical and Mathematical SciencesNanyang Technological UniversitySingapore

Personalised recommendations