Related papers: Extreme rays of the $\ell^\infty$-nearest ultramet…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
Given a dissimilarity map $\delta$ on finite set $X$, the set of ultrametrics (equidistant tree metrics) which are $l^\infty$-nearest to $\delta$ is a tropical polytope. We give an internal description of this tropical polytope which we use…
Tropical polyhedra are known to be representable externally, as intersections of finitely many tropical half-spaces. However, unlike in the classical case, the extreme rays of their polar cones provide external representations containing in…
We define nondegenerate tropical complete intersections imitating the corresponding definition in complex algebraic geometry. As in the complex situation, all nonzero intersection multiplicity numbers between tropical hypersurfaces defining…
We give a characterization of the minimal tropical half-spaces containing a given tropical polyhedron, from which we derive a counter example showing that the number of such minimal half-spaces can be infinite, contradicting some statements…
We investigate uniqueness issues that arise in $l^\infty$-optimization to linear spaces and Bergman fans of matroids. For linear spaces, we give a polyhedral decomposition of $\mathbb{R}^n$ based on the dimension of the set of…
We will say that an infinite tree $T$ is almost a ray if $T$ is the union of a ray and a finite tree. Let $l$ be a non-degenerate labeling of the vertex set $V$ of almost a ray $T$ and let $d_l$ be the corresponding ultrametric on $V$. It…
In this article, we investigate Maximum Likelihood Estimation with tools from Tropical Geometry and Bernstein--Sato theory. We investigate the critical points of very affine varieties and study their asymptotic behavior. We relate these…
We construct minimal and irredundant generating sets for a family of submonoids of the monoid of $n \times n$ upper triangular matrices over a commutative semiring. We show that the monoid of $n \times n$ matrices over the tropical…
A Delaunay polytope $P$ is said to be {\em extreme} if the only (up to isometries) affine bijective transformations $f$ of $\R^n$, for which $f(P)$ is again a Delaunay polytope, are the homotheties. This notion was introduced in…
We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities). The heart of the tropical algorithm is…
We present necessary and sufficient criteria for a max-algebraic supereigenvector, i.e., a solution of the system $A\otimes\textbf{x}\geq\textbf{x}$ with $A\in\overline{\mathbb{R}}^{n\times n}$ in max-plus algebra, to be an extremal. We…
We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear…
In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…
The {\em hypermetric cone} is defined as the cone of semimetrics satisfying the {\em hypermetric inequalities}. Every {\em Delaunay polytope} corresponds to a ray of this polyhedral cone. The Delaunay polytopes, which correspond to extreme…
Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…
A tropical matrix is a matrix defined over the max-plus semiring. For such matrices, there exist several non-coinciding notions of rank: the row rank, the column rank, the Schein/Barvinok rank, the Kapranov rank, or the tropical rank, among…
The "edge polytope" of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k =2, 3, 5 we determine the maximum number of vertices of…
We give the first exact and stability results for a hypergraph Tur\'{a}n problem with infinitely many extremal constructions that are far from each other in edit-distance. This includes an example of triple systems with Tur\'{a}n density…
This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…