Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.05647

Minimal Representations of Tropical Rational Functions

Ngoc Mai Tran·Jidong Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies the following question: given a piecewise-linear function, find its minimal algebraic representation as a tropical rational signomial. We put forward two different notions of minimality, one based on monomial length, the other based on factorization length. We show that in dimension one, both notions coincide, but this is not true in dimensions two or more. We prove uniqueness of the minimal representation for dimension one and certain subclasses of piecewise-linear functions in dimension two. As a proof step, we obtain counting formulas and lower bounds for the number of regions in an arrangement of tropical hypersurfaces, giving a small extension for a result by Montúfar, Ren and Zhang. As an equivalent formulation, it gives a lower bound on the number of vertices in a regular mixed subdivision of a Minkowski sum, giving a small extension for Adiprasito's Lower Bound Theorem for Minkowski sums.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ngoc Mai Tran, Jidong Wang. 2024-01-17. Minimal Representations of Tropical Rational Functions. https://doi.org/10.2140/astat.2024.15.27

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↗