On a Cohen-Lenstra heuristic for Jacobians of random graphs
From MaRDI portal
Publication:887937
DOI10.1007/s10801-015-0598-xzbMath1325.05146arXiv1402.5129OpenAlexW1893225057MaRDI QIDQ887937
Timothy Leake, Julien Clancy, Melanie Matchett Wood, Nathan Kaplan, Sam Payne
Publication date: 4 November 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5129
Related Items (30)
A weighted Möbius function ⋮ The distribution of sandpile groups of random graphs ⋮ Sandpile groups and the coeulerian property for random directed graphs ⋮ Topology and geometry of random 2-dimensional hypertrees ⋮ Small clique number graphs with three trivial critical ideals ⋮ Graphs with few trivial critical ideals ⋮ On a Cohen-Lenstra heuristic for Jacobians of random graphs ⋮ The local weak limit of 𝑘-dimensional hypertrees ⋮ On the distribution of equivalence classes of random symmetric p‐adic matrices ⋮ Universality of the cokernels of random 𝑝-adic Hermitian matrices ⋮ Abelian groups from random hypergraphs ⋮ Joint distribution of the cokernels of random \(p\)-adic matrices ⋮ Two-vertex generators of Jacobians of graphs ⋮ Sandpile groups of random bipartite graphs ⋮ Chip-Firing Games and Critical Groups ⋮ Realization of groups with pairing as Jacobians of finite graphs ⋮ The distribution of sandpile groups of random regular graphs ⋮ Graphs with few trivial characteristic ideals ⋮ Nonabelian Cohen-Lenstra moments ⋮ Random partitions and Cohen-Lenstra heuristics ⋮ Problems in arithmetic topology ⋮ Moments and interpretations of the Cohen-Lenstra-Martinet heuristics ⋮ Recent progress in combinatorial random matrix theory ⋮ Non-abelian Cohen–Lenstra heuristics over function fields ⋮ Cohen-Lenstra heuristics and local conditions ⋮ The sandpile group of a polygon flower ⋮ Some new results in random matrices over finite fields ⋮ Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes ⋮ Hall-Littlewood polynomials and Cohen-Lenstra heuristics for Jacobians of random graphs ⋮ Random integral matrices: universality of surjectivity and the cokernel
Cites Work
- Unnamed Item
- Unnamed Item
- Hall-Littlewood polynomials and Cohen-Lenstra heuristics for Jacobians of random graphs
- Modeling the distribution of ranks, Selmer groups, and Shafarevich-Tate groups of elliptic curves
- On a Cohen-Lenstra heuristic for Jacobians of random graphs
- Arithmetical graphs
- Duality maps of finite abelian groups and their applications to spin models
- Realization of groups with pairing as Jacobians of finite graphs
- Quadratic forms on finite groups, and related topics
- Arithmetic on Curves of Genus 1. IV. Proof of the Hauptvermutung.
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- Heuristics on class groups and on Tate-Shafarevich groups
- Heuristics on Tate-Shafarevitch Groups of Elliptic Curves Defined over Q
- Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
- A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs
- Orthogonal Matrices Over Finite Fields
This page was built for publication: On a Cohen-Lenstra heuristic for Jacobians of random graphs