Jul 27, 2021 · 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 introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most 1 chip on each vertex.
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, ...
Jul 27, 2021 · Abstract. The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We.
People also ask
How do you show multiplicity on a graph?
What is the gonality of a graph?
What is multiplicity in graph theory?
In [DEM23] , Dean, Everett, and Morrison define the multiplicity-free gonality mfgon(G) of a graph G to be the minimum degree of a multiplicity-free divisor of ...
People also search for
The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).
The gonality of a graph measures how few chips we need so that we can move the chips anywhere using chip-firing moves. We introduce multiplicity-free gonality, ...
The last decades have seen an extremely fruitful interplay between Riemann surfaces and graphs with a metric. A de- formation process called tropicalisation ...
It is NP-hard to compute the second gonality of a graph when restricting to multiplicity-free divisors, and bounds are generalizations of known upper and ...
The representation (ρ, V ) is said to be multiplicity free pro- vided that the decomposition of (ˆρ, C[V ]) into a direct sum of irreducible G mod- ules ...