Preprint · v1
Prime-order complements in planar graph Jacobians
Free PDF · 29 pages · 0.76 MB
Abstract
Let be a finite abelian group with a nondegenerate symmetric pairing into , and let be its least number of generators. For infinitely many primes , we realize as the entire paired Jacobian of a simple planar biconnected graph, with one nonzero integer independent of . The primes avoid any prescribed finite set. Every vertex has degree two or three. The graphs have arbitrarily large prescribed girth, treewidth at most two, and cycle rank , which is optimal. For each cycle rank they are subdivisions of one fixed planar multigraph. We construct a family whose complementary orders form a primitive arithmetic progression; an explicit cofactor determines the complementary pairing. Dirichlet’s theorem gives the prime-order conclusion. A separate construction retains outerplanarity, allowing parallel edges and unbounded degree. Finally, for , the paired Jacobian of is the orthogonal sum of hyperbolic planes over . The case contradicts the exceptional-pairing conjecture of Gaudet, Jensen, Ranganathan, Wawrykow and Weisman.
MSC 2020
- 05C25
- Graphs and abstract algebra (groups, rings, fields, etc.)
- 05C50
- Graphs and linear algebra (matrices, eigenvalues, etc.)
- 05C10
- Planar graphs; geometric and topological aspects of graph theory
- 11E08
- Quadratic forms over local rings and fields
- 11N13
- Primes in congruence classes
- 20K01
- Finite abelian groups
Record
- Version DOI
- 10.5281/zenodo.22865118
- All versions
- 10.5281/zenodo.22865117
- Subjects
- Graph Jacobian; monodromy pairing; hyperbolic form; planar graph; prime-order completion; treewidth; finite abelian group
- Language
- English
Cite this paper
Anass Nifa. Prime-order complements in planar graph Jacobians. Preprint, Zenodo, v1 (2026). doi:10.5281/zenodo.22865118
References
As listed in the manuscript bibliography.
- [1]
R. Bacher, P. de la Harpe and T. Nagnibeda, The lattice of integral flows and the lattice of integral cuts on a finite graph, Bull. Soc. Math. France 125 (1997), no. 2, 167–198. 10.24033/bsmf.2303.
DOI - [2]
S. Bosch and D. Lorenzini, Grothendieck's pairing on component groups of Jacobians, Invent. Math. 148 (2002), no. 2, 353–396. 10.1007/s002220100195.
DOI - [3]
- [4]
- [5]
- [6]
P. G. Lejeune Dirichlet, There are infinitely many prime numbers in all arithmetic progressions with first term and difference coprime, English translation by R. Stephan of the 1837 paper, arXiv:0808.1408v2 (2014).
arXiv v2 - [7]
L. Gaudet, D. Jensen, D. Ranganathan, N. Wawrykow and T. Weisman, Realization of groups with pairing as Jacobians of finite graphs, Ann. Comb. 22 (2018), no. 4, 781–801. 10.1007/s00026-018-0406-0. The conjecture and theorem numbering used here is that of arXiv:1410.5144v2 (18 September 2017).
arXiv v2 · DOI - [8]
J. E. Greene, The lens space realization problem, Ann. of Math. (2) 177 (2013), no. 2, 449–511. 10.4007/annals.2013.177.2.3.
DOI - [9]
- [10]
R. Miranda, Nondegenerate symmetric bilinear forms on finite abelian 2-groups, Trans. Amer. Math. Soc. 284 (1984), no. 2, 535–542. 10.1090/S0002-9947-1984-0743731-1.
DOI - [11]
- [12]
A. Nifa, Homocyclic Jacobians of planar biconnected graphs, preprint, 13 pp., 10.5281/zenodo.22859833.
DOI - [13]
J. Shen, Quantative universality for cokernels of matrices with symmetries, preprint, arXiv:2601.09704v1 (2026), Theorem 1.2.
arXiv v1 - [14]
F. Shokrieh, The monodromy pairing and discrete logarithm on the Jacobian of finite graphs, J. Math. Cryptol. 4 (2010), no. 1, 43–56. 10.1515/JMC.2010.002.
DOI - [15]
C. T. C. Wall, Quadratic forms on finite groups, and related topics, Topology 2 (1963), no. 4, 281–298. 10.1016/0040-9383(63)90012-0.
DOI - [16]