Search arXivSearch

arXiv · 2604.25212

Noncrossing Duality and the Geometry of Positive Tropical Linear Spaces

Abstract

While the positive Grassmannian is deeply understood through the rich combinatorics of plabic graphs and positroid cells, its tropical counterpart, the positive tropical Grassmannian Trop$_{>0}G(k,n)$, has lacked a comparable structural framework for general $k$. Both the global face structure of Trop$_{>0}G(k,n)$ and the internal metric geometry of the tropical linear spaces it parametrizes have remained largely uncharted. This paper develops a systematic algebraic and polyhedral foundation that resolves this gap. The engine of our framework is a fundamental tropical duality, analogous to the duality between cluster variables (or more precisely, their $u$-coordinates) and $\mathbf{g}$-vectors, pairing two families of objects introduced by the first author: the planar basis of tropical Plücker vectors and the planar cross-ratios on the positive configuration space. We prove that this duality links the fan structure of the positive tropical Grassmannian to the noncrossing fan of Santos, Stump, and Welker, yielding a global bijection between integer points of $Trop_{>0}G(k,n)$ and noncrossing tableaux. We then study how this discrete combinatorial data controls the continuous metric geometry of positive tropical linear spaces. We realize the bounded complex of an integer positive tropical linear space as the subdifferential of a central roof function on the hypersimplex, and use this realization to embed it into a dilate of the fundamental alcoved simplex. The dilation factor, and hence the geometric diameter of the complex, is governed by a single invariant, the planar kinematics ($K) weight, which we show equals the number of columns in the associated noncrossing tableau. The results of this work are applied in our parallel work on scaffolds for higher tropical Grassmannians.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Early, Thomas Lam. 2026-06-25. Noncrossing Duality and the Geometry of Positive Tropical Linear Spaces. https://arxiv.org/abs/2604.25212

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO