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 functionThe distribution of sandpile groups of random graphsSandpile groups and the coeulerian property for random directed graphsTopology and geometry of random 2-dimensional hypertreesSmall clique number graphs with three trivial critical idealsGraphs with few trivial critical idealsOn a Cohen-Lenstra heuristic for Jacobians of random graphsThe local weak limit of 𝑘-dimensional hypertreesOn the distribution of equivalence classes of random symmetric p‐adic matricesUniversality of the cokernels of random 𝑝-adic Hermitian matricesAbelian groups from random hypergraphsJoint distribution of the cokernels of random \(p\)-adic matricesTwo-vertex generators of Jacobians of graphsSandpile groups of random bipartite graphsChip-Firing Games and Critical GroupsRealization of groups with pairing as Jacobians of finite graphsThe distribution of sandpile groups of random regular graphsGraphs with few trivial characteristic idealsNonabelian Cohen-Lenstra momentsRandom partitions and Cohen-Lenstra heuristicsProblems in arithmetic topologyMoments and interpretations of the Cohen-Lenstra-Martinet heuristicsRecent progress in combinatorial random matrix theoryNon-abelian Cohen–Lenstra heuristics over function fieldsCohen-Lenstra heuristics and local conditionsThe sandpile group of a polygon flowerSome new results in random matrices over finite fieldsCohen–Lenstra Heuristics for Torsion in Homology of Random ComplexesHall-Littlewood polynomials and Cohen-Lenstra heuristics for Jacobians of random graphsRandom integral matrices: universality of surjectivity and the cokernel



Cites Work


This page was built for publication: On a Cohen-Lenstra heuristic for Jacobians of random graphs