Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1211.5338

Local tropical linear spaces

Felipe Rincón
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we study general tropical linear spaces locally: For any basis B of the matroid underlying a tropical linear space L, we define the local tropical linear space L_B to be the subcomplex of L consisting of all vectors v that make B a basis of maximal v-weight. The tropical linear space L can then be expressed as the union of all its local tropical linear spaces, which we prove are homeomorphic to Euclidean space. Local tropical linear spaces have a simple description in terms of polyhedral matroid subdivisions, and we prove that they are dual to mixed subdivisions of Minkowski sums of simplices. Using this duality we produce tight upper bounds for their f-vectors. We also study a certain class of tropical linear spaces that we call conical tropical linear spaces, and we give a simple proof that they satisfy Speyer's f-vector conjecture.

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Felipe Rincón. 2013-06-16. Local tropical linear spaces. https://doi.org/10.1007/s00454-013-9519-8

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↗