Corpus ID: 236447787

Multiplicity-Free Gonality on Graphs

@inproceedings{Dean2021MultiplicityFreeGO,
  title={Multiplicity-Free Gonality on Graphs},
  author={Frances Dean and Max Everett and Ralph Morrison},
  year={2021}
}
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most 1 chip on each vertex. We give a sufficient condition in terms of vertex-connectivity for these two versions of gonality to be equal; and we show that no function of gonality can bound multiplicity-free gonality, even for simple graphs. We also prove that multiplicity-free… Expand

References

SHOWING 1-10 OF 26 REFERENCES
Computing graph gonality is hard
TLDR
It is shown that computing dgon(G) and sgon (G) are NP-hard by a reduction from the maximum independent set problem and the vertex cover problem, respectively, and that computing gonality is moreover APX-hard. Expand
On the Gonality of Cartesian Products of Graphs
TLDR
The upper bound to prove that Baker's gonality conjecture holds for the Cartesian product of any two graphs with two or more vertices each is presented, and precisely which nontrivial product graphs have gonality equal to Baker's conjectural upper bound is determined. Expand
Treewidth is a lower bound on graph gonality
We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs. We prove that theExpand
A combinatorial Li–Yau inequality and rational points on curves
We present a method to control gonality of nonarchimedean curves based on graph theory. Let $$k$$k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of aExpand
Riemann-Roch Theory for Graph Orientations
TLDR
It is shown that the Baker--Norine rank of a partially orientable divisor is one less than the minimum number of directed paths which need to be reversed in the generalized cycle--cocycle reversal system to produce an acyclic partial orientation. Expand
Harmonic morphisms and hyperelliptic graphs
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula,Expand
Riemann–Roch and Abel–Jacobi theory on a finite graph
Abstract It is well known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linearExpand
Gonality of Random Graphs
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
Specialization of linear systems from curves to graphs
We investigate the interplay between linear systems on curves and graphs in the context of specialization of divisors on an arithmetic surface. We also provide some applications of our results toExpand
Self-organized critical state of sandpile automaton models.
  • Dhar
  • Mathematics, Medicine
  • Physical review letters
  • 1990
TLDR
The critical state is characterized, and its entropy for an arbitrary finite lattice in any dimension is determined, and the two-point correlation function is shown to satisfy a linear equation. Expand
...
1
2
3
...