Related papers: Minkowski sum of polytopes and its normality

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…

We prove that for smooth projective toric varieties, the Okounkov body of a $T$-invariant pseudo-effective divisor with respect to a $T$-invariant flag decomposes as a finite Minkowski sum of indecomposable polytopes. We prove that these…

We use Reznick's Theorem for positive homogeneous polynomials to prove an elliptic regularity result for representations of enveloping algebras of Lie algebras. This allows us to relax a technical condition for a sum of squares…

Inspired by the results obtained in \cite{SR}, in this work, we develop techniques to handle the contraction property for weak normalization and Lipschitz saturation of algebras for the following types of algebras: universally injective,…

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a…

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

We show the equivalences of several notions of entropy, like a version of the topological entropy of the geodesic flow and the Minkowski dimension of the boundary, in metric spaces with convex geodesic bicombings satisfying a uniform…

An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A…

In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…

For a convex set (K) of the (n)-dimensional Euclidean space, the Steiner-Minkowski polynomial (M_K(t)) is defined as the (n)-dimensional Euclidean volume of the neighborhood of the radius (t). Being defined for positive (t), the…

Ordinary polytopes were introduced by Bisztriczky as a (nonsimplicial) generalization of cyclic polytopes. We show that the colex order of facets of the ordinary polytope is a shelling order. This shelling shares many nice properties with…

We prove that Hopf manifolds admit holomorphic $(G,X)$-structures, extending to any dimension a result of McKay and Pokrovskiy. For this, we revisit Guysinsky-Katok's group of invertible sub-resonant polynomials, and Bertheloot's approach…

We study local normal forms for completely integrable systems on Poisson manifolds in the presence of additional symmetries. The symmetries that we consider are encoded in actions of compact Lie groups. The existence of Weinstein's…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

We consider billiard systems within compact domains bounded by confocal conics on a hyperboloid of one sheet in the Minkowski space. We derive conditions for elliptic periodicity for such billiards. We describe the topology of those…

Let $f \colon X \to X$ be a surjective endomorphism of a normal projective surface. When $\operatorname{deg} f \geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$.…

One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework…

Lattice polytopes are called IDP polytopes if they have the integer decomposition property, i.e., any lattice point in a $k$th dilation is a sum of $k$ lattice points in the polytope. It is a long-standing conjecture whether the numerator…

Although intersection homology lacks a ring structure, certain expressions (called uniform) in the intersection homology of an irreducible projective variety $X$ always give the same value, when computed via the decomposition theorem on any…