Iwasawa theory of Jacobians of graphs
From MaRDI portal
Publication:2097189
Abstract: The Jacobian group (also known as the critical group or sandpile group) is an important invariant of a finite, connected graph ; it is a finite abelian group whose cardinality is equal to the number of spanning trees of (Kirchhoff's Matrix Tree Theorem). A specific type of covering graph, called a derived graph, that is constructed from a voltage graph with voltage group is the object of interest in this paper. Towers of derived graphs are studied by using aspects of classical Iwasawa Theory (from number theory). Formulas for the orders of the Sylow -subgroups of Jacobians in an infinite voltage -tower, for any prime , are obtained in terms of classical and invariants by using the decomposition of a finitely generated module over the Iwasawa Algebra.
Recommendations
Cites work
- Arborescences of covering graphs
- Chip-firing and the critical group of a graph
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- Critical groups of covering, voltage and signed graphs
- Cyclotomic Fields and Zeta Values
- Divisors and sandpiles. An introduction to chip-firing
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- Integer invariants of abelian Cayley graphs
- Number theory 3. Iwasawa theory and modular forms. Transl. from the Japanese by Masato Kuwata
- On abelian \(\ell\)-towers of multigraphs
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- On the critical group of the \(n\)-cube
- On Γ-extensions of algebraic number fields
- Self-organized critical state of sandpile automaton models
- The critical group from a cryptographic perspective
- The critical group of a threshold graph
- The critical group of the Kneser graph on 2-subsets of an n-element set
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- The mathematics of chip-firing
- The Smith and critical groups of Paley graphs
- Zeta functions of graphs. A stroll through the garden
Cited in
(25)- Two-vertex generators of Jacobians of graphs
- Jacobian tori associated with a finite graph and its abelian covering graphs
- Plans' periodicity theorem for Jacobian of circulant graphs
- The non-\(\ell\)-part of the number of spanning trees in abelian \(\ell\)-towers of multigraphs
- On the structure of the Jacobian group for circulant graphs
- scientific article; zbMATH DE number 1064800 (Why is no real title available?)
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- scientific article; zbMATH DE number 2104102 (Why is no real title available?)
- Exponents of Jacobians of graphs and regular matroids
- On the Jacobian group for Möbius ladder and prism graphs
- On \(\mathbb{Z}_{\ell}^d\)-towers of graphs
- ON THE DISTRIBUTION OF IWASAWA INVARIANTS ASSOCIATED TO MULTIGRAPHS
- A Torelli theorem for graph isomorphisms
- Jacobians of nearly complete and threshold graphs
- Fitting ideals of Jacobian groups of graphs
- On the growth of the Jacobians in \(\mathbb{Z}_p^l\)-voltage covers of graphs
- On Jacobian group and complexity of the Y-graph
- The Jacobian of a graph and graph automorphisms
- On the Iwasawa theory of Cayley graphs
- On towers of isogeny graphs with full level structures
- Spanning trees in \(\mathbb{Z} \)-covers of a finite graph and Mahler measures
- Iwasawa theory for branched \(\mathbb{Z}_p\)-towers of finite graphs
- Kida's formula for graphs with ramifications
- Iwasawa theory for weighted graphs
- Iwasawa theory for vertex-weighted graphs
This page was built for publication: Iwasawa theory of Jacobians of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097189)