Search arXivSearch

arXiv · 2306.11118

On the Semigroup of Graph Gonality Sequences

Abstract

The $r$th gonality of a graph is the smallest degree of a divisor on the graph with rank $r$. The gonality sequence of a graph is a tropical analogue of the gonality sequence of an algebraic curve. We show that the set of truncated gonality sequences of graphs forms a semigroup under addition. Using this, we study which triples $(x,y,z)$ can be the first 3 terms of a graph gonality sequence. We show that nearly every such triple with $z \geq \frac{3}{2}x+2$ is the first three terms of a graph gonality sequence, and also exhibit triples where the ratio $\frac{z}{x}$ is an arbitrary rational number between 1 and 3. In the final section, we study algebraic curves whose $r$th and $(r+1)$st gonality differ by 1, and posit several questions about graphs with this property.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Austin Fessler, David Jensen, Elizabeth Kelsey, Noah Owen. 2023-06-19. On the Semigroup of Graph Gonality Sequences. https://arxiv.org/abs/2306.11118

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO