Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2005.13727

Tropical flag varieties

Madeline Brandt·Christopher Eur·Leon Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Flag matroids are combinatorial abstractions of flags of linear subspaces, just as matroids are of linear subspaces. We introduce the flag Dressian as a tropical analogue of the partial flag variety, and prove a correspondence between: (a) points on the flag Dressian, (b) valuated flag matroids, (c) flags of projective tropical linear spaces, and (d) coherent flag matroidal subdivisions. We introduce and characterize projective tropical linear spaces, which serve as a fundamental tool in our proof. We apply the correspondence to prove that all valuated flag matroids on ground set up to size 5 are realizable, and give an example where this fails for a flag matroid on 6 elements.

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madeline Brandt, Christopher Eur, Leon Zhang. 2021-03-05. Tropical flag varieties. https://arxiv.org/abs/2005.13727

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗