Exponents of Jacobians of graphs and regular matroids
From MaRDI portal
Abstract: Let be a finite undirected multigraph with no self-loops. The Jacobian is a finite abelian group associated with whose cardinality is equal to the number of spanning trees of . There are only a finite number of biconnected graphs such that the exponent of equals or . The definition of a Jacobian can also be extended to regular matroids as a generalization of graphs. We prove that there are finitely many connected regular matroids such that has exponent and characterize all such matroids.
Recommendations
Cited in
(10)- On critical exponents of Dowling matroids
- Iwasawa theory of Jacobians of graphs
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- scientific article; zbMATH DE number 1064800 (Why is no real title available?)
- scientific article; zbMATH DE number 2104102 (Why is no real title available?)
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- scientific article; zbMATH DE number 6256578 (Why is no real title available?)
- Jacobians of nearly complete and threshold graphs
- The Jacobian of a graph and graph automorphisms
- On the proportion of metric matroids whose Jacobians have nontrivial \(p\)-torsion
This page was built for publication: Exponents of Jacobians of graphs and regular matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965493)