Search arXivSearch

arXiv · 2511.20805

The $d$-gonal locus in the moduli space of tropical plane curves

Abstract

We introduce and study the locus $\mathbb{M}_{g,d}^\textrm{nd}$ of genus $g$ tropical plane curves of gonality $d$ inside the moduli space $\mathbb{M}^{\textrm{nd}}_{g}$ of tropical plane curves of genus $g$. Each such tropical curve arises from a Newton polygon, and we conjecture that the gonality of the tropical curve is equal to an easily computed parameter of this polygon called the expected gonality, closely related to the lattice width of the polygon. Let $\mathbb{M}_{g,{\underline{d}}}^\textrm{nd}$ denote the locus of tropical curves whose associated Newton polygon has expected gonality $d$. We prove that for fixed $d$ and sufficiently large genus $g$, the dimensions of these two loci agree: \[ \\dim\left(\mathbb{M}_{g,d}^\textrm{nd}\right) =\dim\left(\mathbb{M}_{g,{\underline{d}}}^\textrm{nd}\right). \] Our results provide evidence that, in sufficiently high genus compared to expected gonality, the gonality of a tropical curve is determined by the expected gonality of the Newton polygon from which it arises.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Desmond Leitz, Ralph Morrison, Søren Newman-Taylor, Vincent X. Wang. 2025-11-25. The $d$-gonal locus in the moduli space of tropical plane curves. https://arxiv.org/abs/2511.20805

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO