Related papers: Convex-normal (pairs of) polytopes

Let $P$ and $Q$ be finite partially ordered sets on $[d] = \{1, \ldots, d\}$, and $\mathcal{O}(P) \subset \mathbb{R}^{d}$ and $\mathcal{O}(Q) \subset \mathbb{R}^{d}$ their order polytopes. The twinned order polytope of $P$ and $Q$ is the…

In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of…

Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…

Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. In…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

For each $d\geq 3$, $n \geq 10$, and $k_1, k_2, \ldots, k_{d-1}\geq 2$ with $k_1+k_2+\ldots+k_{d-1}\leq n-1$, we construct a regular $d$-polytope whose automorphism group is of order $2^n$ and whose Schl\"afli type is $\{2^{k_1},2^{k_2},…

We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We…

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…

The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $\Gamma(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex…

An antinorm is a concave analogue of a norm. In contrast to norms, antinorms are not defined on the entire space $R^d$ but on a cone $K\subset R^d$. They are applied in the matrix analysis, optimal control, and dynamical systems. Their…

This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…

In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…