Realization of groups with pairing as Jacobians of finite graphs
From MaRDI portal
Publication:1711003
DOI10.1007/s00026-018-0406-0zbMath1403.05060arXiv1410.5144OpenAlexW2962810311MaRDI QIDQ1711003
Nicholas Wawrykow, Theodore Weisman, Dhruv Ranganathan, Louis Gaudet, David Jensen
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
On a Cohen-Lenstra heuristic for Jacobians of random graphs ⋮ Two-vertex generators of Jacobians of graphs ⋮ Chip-Firing Games and Critical Groups
Cites Work
- Unnamed Item
- On a Cohen-Lenstra heuristic for Jacobians of random graphs
- Arithmetical graphs
- On the sandpile group of dual graphs
- Grothendieck's pairing on component groups of Jacobians.
- Chip-firing games, potential theory on graphs, and spanning trees
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Quadratic forms on finite groups, and related topics
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- Self-organized critical state of sandpile automaton models
- Arithmetical properties of laplacians of graphs
- Explicit bounds for primes in residue classes
- Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
- A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs
- The distribution of sandpile groups of random graphs
- Prime splitting in abelian number fields and linear combinations of Dirichlet characters
This page was built for publication: Realization of groups with pairing as Jacobians of finite graphs
