🔢 mathematics

Relating Different Definitions of Linear Series on Tropical Curves

This paper investigates the relationships among various definitions of linear series on tropical curves by introducing new concepts to show that strongly recursive tropical linear series are combinatorial limit linear series, while also providing counterexamples to the converse implications and analyzing the role of permutation arrays in their local combinatorial data.

Original authors: Eric Burkholder

Published 2026-07-28

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Eric Burkholder

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where the smooth, flowing curves of algebraic geometry are replaced by a landscape made entirely of straight lines and sharp corners. This is the realm of tropical geometry. Instead of drawing a circle with a compass, you draw a shape made of line segments that meet at specific angles, like a stick figure made of wire. In this world, the "curves" are actually networks of roads (called metric graphs) where you can walk from one point to another. Just as you can draw lines on a piece of paper, mathematicians study "linear series" here—collections of functions that act like maps, telling you how to navigate these wire-frame landscapes.

Why does anyone care about wire-frame maps? Because these tropical shapes are surprisingly powerful. They act like a "degenerate" version of complex algebraic curves, allowing mathematicians to solve difficult problems in classical geometry by turning them into simpler, combinatorial puzzles. Think of it as translating a complex symphony into a simple drum beat; if you can understand the rhythm (the tropical version), you can often figure out the melody (the classical version). The big question in this field has been: "What exactly counts as a valid collection of these maps?" Over the last few years, different groups of mathematicians have proposed different rulebooks for what makes a "linear series" on these tropical curves. Some rules are strict and recursive (like a recipe that requires you to have already baked a smaller cake before you can bake a bigger one), while others are more focused on local patterns (like checking the texture of the dough in just one spot).

This paper, written by Eric Burkholder, is essentially a massive translation guide and a detective story rolled into one. Burkholder investigates the relationships between these different rulebooks. He introduces new concepts called "locally weakly recursive" and "structured" series to act as a bridge. His main finding is a proven connection: every "locally weakly recursive" tropical linear series is automatically a "combinatorial limit linear series." In fact, he proves that every "strongly recursive" tropical linear series is also a "combinatorial limit linear series." This is a solid, mathematical proof, not just a guess.

However, the paper also plays the role of a reality check. Burkholder constructs specific counterexamples to show that the reverse is not true. He proves that while every strongly recursive series is a combinatorial limit series, not every combinatorial limit series is "strongly recursive." In other words, the strict, recipe-style rulebook is a subset of the broader, pattern-based rules, but the broader rules allow for structures that fail the strict recursive tests. He shows that while some of these definitions overlap perfectly in simple cases (like on a straight line or a loop), they start to diverge when the shapes get more complex or the rank (the "size" of the collection) gets higher. Specifically, he demonstrates that for ranks of 3 or higher, you can find structures that fit the combinatorial limit definition but fail to be strongly recursive.

The paper also dives into the "local data" of these series, using objects called permutation arrays. You can think of these arrays as multi-dimensional grids of dots that record the "slope" or direction of the functions at every point. Burkholder asks: "Can any random pattern of dots on these grids actually be realized by a real tropical linear series?" He proves that for low ranks and simple shapes, the answer is yes. But for higher ranks and more complex grids, he provides a class of counterexamples—specific patterns of dots that look valid but simply cannot be built by any valid tropical linear series. He leaves the door open for rank 2, noting that it remains an open question whether all rank 2 series are "strongly recursive," but for higher ranks, the answer is a definitive "no" for certain patterns. Ultimately, the paper doesn't just list definitions; it maps out exactly where these definitions agree, where they disagree, and where the rules of the tropical world break down.

Technical Summary: Relating Different Definitions of Linear Series on Tropical Curves

Problem Statement
Over the past two decades, the theory of divisors and linear series on tropical curves (modeled as finite and metric graphs) has developed several distinct definitions for "linear series." While the tropical Riemann-Roch theorem and the tropical Brill-Noether theorem have been established, the landscape of incomplete linear series remains fragmented. The paper investigates the relationships among four primary notions:

Tropical linear series (as defined in [CDI+25]), which are finitely generated tropical submodules satisfying specific rank and dependence conditions.
Strongly recursive tropical linear series (introduced by Farkas, Jensen, and Payne in [FJP25]), which impose strict recursive containment conditions on subseries.
Combinatorial limit linear series (defined by Amini and Gierczak in [AG22]), which focus on local combinatorial data (slope structures and permutation arrays) at points of the metric graph.
Structured tropical linear series, a new concept introduced in this work.

The central problem is to determine the inclusion relationships between these definitions. Specifically, the author seeks to clarify whether tropicalizations of classical linear series (which satisfy all these definitions) represent the full scope of these tropical notions, and whether the recursive conditions required by [FJP25] are necessary or if they can be weakened without losing the structural properties of combinatorial limit linear series.

Methodology
The paper employs a combination of combinatorial geometry, tropical algebra, and topological arguments on metric graphs.

Slope Structures and Permutation Arrays: The author utilizes the framework of slope structures (collections of integers and permutation arrays associated with tangent vectors) to encode local data. Permutation arrays, adapted from Eriksson and Linusson [EL00], serve as the combinatorial backbone for defining rank and local behavior.
Local Arrays: For a tropical linear series $\Sigma$ , the author defines a "local array" $P_v$ at a point $v$ , representing the set of slope indices realized by functions in $\Sigma$ . The paper analyzes the properties of these arrays, specifically closure under the meet operation (pointwise minimum) and conditions related to tropical dependence.
Recursive Conditions: The paper introduces "weakly recursive" and "locally weakly recursive" conditions. A series is weakly recursive if any two functions lie in a rank 1 subseries. It is locally weakly recursive if this holds in a neighborhood of every point.
Limit Arguments: To bridge the gap between local combinatorial data and global existence, the author uses compactness arguments in the $||\cdot||_\infty$ -topology. By constructing sequences of functions satisfying the Baker-Norine Rank Property (BNRP) and taking limits, the author proves the existence of functions satisfying the Local Rank Property (LRP).
Counterexamples: The paper constructs specific counterexamples using valuated matroids (specifically the Vámos matroid) and recursive constructions of permutation arrays to demonstrate the failure of converse implications.

Key Contributions and Results

Introduction of Structured and Locally Weakly Recursive Series:
The author defines a tropical linear series as structured if it is subject to and realizes a slope structure. A series is locally weakly recursive if, locally, any two functions are contained in a rank 1 subseries.
Equivalence of Structured and Combinatorial Limit Linear Series (Theorem 1.3):
The paper proves that a tropical linear series is a combinatorial limit linear series if and only if it is structured. This establishes that the combinatorial definition of [AG22] is equivalent to the existence of a compatible slope structure.
Main Theorem: Locally Weakly Recursive Implies Combinatorial Limit (Theorem 1.1):
The primary result states that every locally weakly recursive tropical linear series is a combinatorial limit linear series.
- Corollary 1.2: Consequently, every strongly recursive tropical linear series (which is by definition locally weakly recursive) is a combinatorial limit linear series.
- Proof Strategy: The proof demonstrates that the local arrays of a locally weakly recursive series are the redundant closures of permutation arrays. This allows the construction of a global slope structure that the series realizes.
Extensions to Low Rank and Specific Graphs:
The author extends these results to show that all tropical linear series of rank $r \le 2$ are structured. Furthermore, on metric graphs where all points have valence $\le 2$ (such as intervals and loops), every tropical linear series is structured, regardless of rank.
Counterexamples to Converse Implications:
The paper provides counterexamples showing that the converses of the main theorems fail:
- Not every structured tropical linear series is strongly recursive. Using the Vámos matroid, the author constructs a structured series of rank $r \ge 3$ that fails the recursive condition (3) of [FJP25].
- Not every permutation array can be realized as the local array of a strongly recursive tropical linear series. The author presents an infinite class of permutation arrays (starting with a rank 4, dimension 4 example from [BV08]) that fail the property (P4-S), a necessary condition for strong recursiveness.
Realizability of Permutation Arrays:
The paper investigates when permutation arrays can arise as local data. It confirms realizability for sparse arrays and rank 2 arrays. However, for higher ranks and dimensions, realizability as a strongly recursive series is not guaranteed, though realizability as a structured series (or general tropical linear series) remains an open question for rank 3.

Significance and Claims
The paper claims to unify several disparate definitions of tropical linear series by establishing a hierarchy of implications:
$\text{Strongly Recursive} \implies \text{Locally Weakly Recursive} \implies \text{Structured} \iff \text{Combinatorial Limit}$
The significance lies in demonstrating that the stringent recursive conditions required by [FJP25] are sufficient but not necessary for a series to be a combinatorial limit linear series. The "locally weakly recursive" condition is shown to be the precise threshold for a tropical linear series to admit a slope structure and thus qualify as a combinatorial limit linear series.

The author modestly notes that the question of whether all tropical linear series are structured (Question 5.1) remains open, though it is proven true for low ranks and specific graph topologies. Similarly, the realizability of all permutation arrays as local data for structured series is left as an open problem, with the paper providing only partial positive results and specific counterexamples for the stronger "strongly recursive" case. The work clarifies the combinatorial landscape of tropical linear series, showing that while the recursive definitions are powerful, they are strictly stronger than the combinatorial limit definitions.

More like this