We prove that the proportion of $0/1$-equivalence classes of $d$-dimensional $(0,1)$-polytopes that are normal tends to zero at least at a double exponential rate as $d\to\infty$. As a consequence, the same holds for any of the following classes given by the type of triangulation possible: (a) quadratic, (b) flag unimodular, (c) regular unimodular, or (d) unimodular, among others. We classify the $0/1$-equivalence classes of $d$-dimensional $(0,1)$-polytopes for $d\leq5$ according to whether they admit a unimodular, flag unimodular, or quadratic triangulation. In dimension five, exactly $175$ out of $1{,}226{,}525$ classes have a flag unimodular triangulation, but no quadratic triangulation. Among them, there are polytopes whose toric rings are not Koszul; thus, we find the first polytopes that have a flag unimodular triangulation, but whose toric ring is not Koszul. In contrast with the matroid case, we exhibit a delta-matroid polytope that is not normal.
A long-standing question posed by Fukuda (1995) and Ziegler (2000) inquires about the asymptotic behavior of $g(n)$, the maximum number of facets that an $n$-dimensional $0/1$-polytope can have. A remarkable result by B\'ar\'any and P\'or (2001) via probabilistic methods established that $g(n)$ is at least superexponen...
Let $g(n)$ denote the largest number of facets of a full-dimensional $0/1$-polytope in $\R^n$. We prove that there are absolute constants $c>0$ and $n_0$ such that $$ g(n)\ge (cn)^{n/2}\quad(n\ge n_0). $$ This removes the logarithmic factor from the lower bound $\bigl(cn/\log n\bigr)^{n/2}$ of Gatzouras, Giannopoulos,...
The degree-distortion tradeoff for polynomial approximation of the $d$-dimensional cross-polytope $B_1^d$ is determined, and degree $\Theta(d)$ is necessary and sufficient for constant distortion.
For a positive integer $n$, let $S(n)=\{\sigma(d): d\mid n\}$ be ordered by divisibility, and let $a(n)$ be its width. We study how much of the divisor lattice of $n$ survives under the map $d\mapsto \sigma(d)$. For every fixed prime-exponent pattern, the largest possible value of $a(n)$ is the width of a corresponding...
We study the combinatorial (red-blue) discrepancy of finite point sets with respect to hyperplanes and, more generally, bounded-complexity affine algebraic sets. We prove that every $n$-point set in a real Euclidean space admits a red-blue coloring for which every affine algebraic set of dimension at most $D$ and degre...
We continue the study of the convex hull $D\subset\mathbb{R}^{d+n}$ of a disjunction of $n+1$ polytopes in $\mathbb{R}^d$, managed by $n$ binary indicator variables. Previously, $D$ had been characterized for arbitrary polytopes when $d\in\{1,2\}$, for polytopes sharing a common constraint matrix (under a technical con...
Yu-Shan Qu, Jon Lee· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
