Two-vertex generators of Jacobians of graphs

MaRDI QIDQ1700775zbMATH OpenFDO

Authors David Brandfonbrener, Pat Devlin, Netanel Friedenberg, Yuxuan Ke, Steffen Marcus, Henry Reichard, Ethan Sciamma

Publication date 22 February 2018

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.03069, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p15

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

critical groupsJacobians of graphssandpile groups

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80)

Abstract: We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and support them with empirical evidence.

Review text

Summary: We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by \textit{R. Becker} and \textit{D. B. Glass} [Australas. J. Comb. 64, 366--375 (2016; Zbl 1333.05254)] and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and support them with empirical evidence.

Recommendations

• scientific article; zbMATH DE number 1064800
• On a two-parameter generalization of Jacobsthal numbers and its graph interpretation
• Graphs and the Jacobian conjecture
• Jacobians of nearly complete and threshold graphs
• A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs
• The nonorientable genus of some Jacobson graphs and classification of the projective ones
• Iwasawa theory of Jacobians of graphs
• A graph-theoretic approach to Jacobsthal polynomials
• Jacobian in genus 2
• On the jacobian module associated to a graph

Cites work

• A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Arithmetical graphs
• Cyclic critical groups of graphs
• Divisors and sandpiles. An introduction to chip-firing
• Graphs and matrices
• Graphs, Algorithms, and Optimization
• On a Cohen-Lenstra heuristic for Jacobians of random graphs
• Realization of groups with pairing as Jacobians of finite graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Smith normal form and Laplacians
• The distribution of sandpile groups of random graphs
• The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Cited in

(6)

• The sandpile group of a polygon flower
• scientific article; zbMATH DE number 1064800 (Why is no real title available?)
• jacobians
• Chip-firing games and critical groups
• A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs
• Fibonacci sumsets and the gonality of strip graphs

Describes a project that uses

Uses Software

• SageMath
• GitHub

This page was built for publication: Two-vertex generators of Jacobians of graphs

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