Math-1881 · mathematics · Combinatorics

Math-1881

Gonality and edge subdivisions

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

For a finite connected loopless graph $G$, a divisor is an integer vector $D\in\mathbb Z^{V(G)}$, of degree $\sum_vD(v)$. It is effective if every coordinate is nonnegative. Two divisors are equivalent if their difference is $L_Gz$ for an integer vector $z$, where $(L_Gz)(v)=\sum_{vw\in E(G)}(z(v)-z(w))$ counts edge multiplicities. An effective divisor has rank at least one if $D-\mathbf1_v$ is equivalent to an effective divisor for every vertex $v$. The divisorial gonality $\operatorname{gon}(G)$ is the minimum degree of such a divisor.

Let $G^{(k)}$ replace every edge by a path of $k+1$ edges, inserting $k$ new vertices per edge. Determine how $\operatorname{gon}(G^{(k)})$ depends on $G$ and $k$, including sharp bounds relative to $\operatorname{gon}(G)$ and conditions for equality or strict decrease. One specific remaining question asks whether strict decrease can occur when $k+1>1$ is odd.

Uniform subdivision does not always preserve divisorial gonality: the cited counterexamples already give a decrease when $k=1$. Divisors on the subdivided graph may put chips on newly inserted vertices, and equivalence uses its new Laplacian. This discrete problem does not silently replace vertex-supported divisors by arbitrary points of a metric graph.

Short English statement

How does subdividing every edge equally affect discrete divisorial gonality, and can an odd number of replacement segments cause a decrease?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.