相关论文: Convexity of tropical polytopes
In this paper we give a short, elementary proof of a known result in tropical mathematics, by which the convexity of the column span of a zero--diagonal real matrix $A$ is characterized by $A$ being a Kleene star. We give applications to…
This paper summarizes results on some topics in the max-plus convex geometry, mainly concerning the role of multiorder, Kleene stars and cyclic projectors, and relates them to some topics in max algebra. The multiorder principle leads to…
We introduce a notion of dimension of max-min convex sets, following the approach of tropical convexity. We introduce a max-min analogue of the tropical rank of a matrix and show that it is equal to the dimension of the associated polytope.…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…
The purpose of this paper is to investigate the interplay arising between max algebra, convexity and scaling problems. The latter, which have been studied in nonnegative matrix theory, are strongly related to max algebra. One problem is…
A polytrope is a tropical polyhedron that is also classically convex. We study the tropical combinatorial types of polytropes associated to weighted directed acyclic graphs (DAGs). This family of polytropes arises in algebraic statistics…
In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…
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…
The goal of this paper is to study convex lattice sets by the discrete Legendre transform. The definition of the polar of convex lattice sets in $\mathbb{Z}^n$ is provided. It is worth mentioning that the polar of convex lattice sets have…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
We study the max-plus or tropical analogue of the notion of polar: the polar of a cone represents the set of linear inequalities satisfied by its elements. We establish an analogue of the bipolar theorem, which characterizes all the…
We study how geometric properties of tropical convex sets and polytopes, which are of interest in many application areas, manifest themselves in their algebraic structure as modules over the tropical semiring. Our main results establish a…
We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of $(R\cup\{-\infty\})^n$ can be written as the max-plus convex combination of at most $n+1$ of the extreme points of this…