Related papers: Minkowski summands of cubes
In a seminal paper "Volumen und Oberfl\"ache" (1903), Minkowski introduced the basic notion of mixed volumes and the corresponding inequalities that lie at the heart of convex geometry. The fundamental importance of characterizing the…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
Let $C$ be a closed convex cone in ${\mathbb R}^n$, pointed and with interior points. We consider sets of the form $A=C\setminus A^\bullet$, where $A^\bullet\subset C$ is a closed convex set. If $A$ has finite volume (Lebesgue measure),…
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex…
A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…
We consider the simplices $$ K_n^A=\{x\in\mathbb{R}^{n+1}:x_1\ge x_2\ge \ldots\ge x_{n+1},x_1-x_{n+1}\le 1,x_1+\ldots+x_{n+1}=0\} $$ and $$ K_n^B=\{x\in\mathbb{R}^n:1\ge x_1\ge x_2\ge \ldots\ge x_n\ge 0\}, $$ which are called the Schl\"afli…
We construct a metric simplicial complex which is an almost isometric model of the moduli space M(S) of Riemann surfaces. We then use this model to compute the "tangent cone at infinity" of M(S): it is the topological cone on the quotient…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
There are many problems and configurations in Euclidean geometry that were never extended to the framework of (normed or) finite dimensional real Banach spaces, although their original versions are inspiring for this type of generalization,…
This is a chapter (planned to appear in Wiley's upcoming Encyclopedia of Operations Research and Management Science) describing parts of the theory of convex polyhedra that are particularly important for optimization. The topics include…
Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…
We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge…
The aim of the paper is to develop a unified algebraical approach to representing the Minkowski difference for convex polyhedra. Namely, there is proposed an exact analytical formulas of the Minkowski difference for convex polyhedra with…
A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…
It is known that in the Minkowski sum of $r$ polytopes in dimension $d$, with $r<d$, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand. However, the number of vertices for…
Steiner and Schwarz symmetrizations, and their most important relatives, the Minkowski, Minkowski-Blaschke, fiber, inner rotational, and outer rotational symmetrizations, are investigated. The focus is on the convergence of successive…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
Consider a real point configuration $\mathbf{A}$ of size $n$ and an integer $r \leq n$. The vertices of the $r$-lineup polytope of $\mathbf{A}$ correspond to the possible orderings of the top $r$ points of the configuration obtained by…
We extend the well-known Rainwater-Simons convergence theorem to various generalized convergence methods such as strong matrix summability, statistical convergence and almost convergence. In fact we prove these theorems not only for…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…