Two-vertex generators of Jacobians of graphs (Q1700775): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Riemann-Roch and Abel-Jacobi theory on a finite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Critical Groups of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Cohen-Lenstra heuristic for Jacobians of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of groups with pairing as Jacobians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, Algorithms, and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smith normal form and Laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monodromy pairing and discrete logarithm on the Jacobian of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of sandpile groups of random graphs / rank
 
Normal rank

Revision as of 04:32, 15 July 2024

scientific article
Language Label Description Also known as
English
Two-vertex generators of Jacobians of graphs
scientific article

    Statements

    Two-vertex generators of Jacobians of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 2018
    0 references
    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.
    0 references
    sandpile groups
    0 references
    critical groups
    0 references
    Jacobians of graphs
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references