Realization of groups with pairing as Jacobians of finite graphs

DOI10.1007/S00026-018-0406-0MaRDI QIDQ1711003zbMATH OpenOpenAlexFDO

Authors Louis Gaudet, David Jensen, Dhruv Ranganathan, Nicholas Wawrykow, Theodore Weisman

Publication date 24 January 2019

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.5144

zbMATH Keywords

graph Jacobiansgroups with pairing

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: We study which groups with pairing can occur as the Jacobian of a finite graph. We provide explicit constructions of graphs whose Jacobian realizes a large fraction of odd groups with a given pairing. Conditional on the generalized Riemann hypothesis, these constructions yield all groups with pairing of odd order, and unconditionally, they yield all groups with pairing whose prime factors are sufficiently large. For groups with pairing of even order, we provide a partial answer to this question, for a certain restricted class of pairings. Finally, we explore which finite abelian groups occur as the Jacobian of a simple graph. There exist infinite families of finite abelian groups that do not occur as the Jacobians of simple graphs.

Recommendations

• Nonlocal and nonvariational extensions of Killing-type equations
• Lie algebras of conservation laws of variational ordinary differential equations
• On integrability of the Killing equation
• scientific article; zbMATH DE number 3976431
• On equations with universal invariance

Cites work

• A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs
• Arithmetical graphs
• Arithmetical properties of laplacians of graphs
• Chip-firing games, potential theory on graphs, and spanning trees
• Explicit bounds for primes in residue classes
• Grothendieck's pairing on component groups of Jacobians.
• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
• On a Cohen-Lenstra heuristic for Jacobians of random graphs
• On the sandpile group of dual graphs
• Prime splitting in abelian number fields and linear combinations of Dirichlet characters
• Quadratic forms on finite groups, and related topics
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Self-organized critical state of sandpile automaton models
• The distribution of sandpile groups of random graphs
• The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Cited in

(10)

• Nonlocal and nonvariational extensions of Killing-type equations
• Two-vertex generators of Jacobians of graphs
• Iwasawa theory of Jacobians of graphs
• The real Jacobi group revisited
• On the realizability of a graph as the Gruenberg-Kegel graph of a finite group
• Chip-firing games and critical groups
• Gluing of graphs and their Jacobians
• Fitting ideals of Jacobian groups of graphs
• On the critical group of hinge graphs
• On a Cohen-Lenstra heuristic for Jacobians of random graphs

This page was built for publication: Realization of groups with pairing as Jacobians of finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711003)