相关论文: Revlex-Initial 0/1-Polytopes

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…

The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we show that the vertices of an N-vertex polytope in R^d can be…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

In this paper, we show that for given integers $h$ and $d$ with $h \geq 1$ and $d \geq 3$, there exists a non-normal very ample integral convex polytope of dimension $d$ which has exactly $h$ holes.

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

An \emph{interval vector} is a $(0,1)$-vector in $\mathbb{R}^n$ for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of interval vectors in $\mathbb{R}^n$. We study three particular…

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume. Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on $P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that every function…

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…

In 1967, Gr\"unbaum conjectured that the function $$ \phi_k(d+s,d):=\binom{d+1}{k+1}+\binom{d}{k+1}-\binom{d+1-s}{k+1},\; \text{for $2\le s\le d$} $$ provides the minimum number of $k$-faces for a $d$-dimensional polytope (abbreviated as a…

Maxwell introduced a necessary minimum number of edges in terms of the number of vertices required for a graph to yield a Euclidean rigid generic framework in $\mathbb{R}^3$, this count was generalised to $\mathbb{R}^d$, for all $d\geq 1$.…

Let $X$ be a normal projective variety of dimension $d$, and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the first-degree growth rate of $f$, so that $\deg_1(f^n) \asymp n^{k}$. We prove the sharp lower bound for the…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…