Search arXivSearch

arXiv · 2412.12059

Lorentzian polynomials and the incidence geometry of tropical linear spaces

Abstract

We introduce a notion of Lorentzian proper position in close analogy to proper position of stable polynomials. Using this notion, we give a new characterization of elementary quotients of M-convex function that parallels the Lorentzian characterization of M-convex functions. We thereby use Lorentzian proper position to study the incidence geometry of tropical linear spaces, and vice versa. In particular, we prove new structural results on the moduli space of codimension-1 tropical linear subspaces of a given tropical linear space. Applying these results, we show that some properties of classical linear incidence geometry fail for tropical linear spaces. For instance, we show that the poset of all matroids on $[n]$, partially ordered by matroid quotient, is not submodular when $n\geq 8$. On the other hand, we introduce a notion of adjoints for tropical linear spaces, generalizing adjoints of matroids, and show that certain incidence properties expected from classical geometry hold for tropical linear spaces that have adjoints.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jidong Wang. 2026-03-07. Lorentzian polynomials and the incidence geometry of tropical linear spaces. https://arxiv.org/abs/2412.12059

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