Related papers: Combinatorial Inscribability Obstructions for High…
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths with straightedge and compass, provided $n$ is at…
Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
Torsion polynomials connect the genus of a hyperbolic knot (a topological invariant) with the discrete faithful representation (a geometric invariant). Using a new combinatorial structure of an ideal triangulation of a 3-manifold that…
The cyclic polytope $C(n,d)$ is the convex hull of any $n$ points on the moment curve ${(t,t^2,...,t^d):t \in \reals}$ in $\reals^d$. For $d' >d$, we consider the fiber polytope (in the sense of Billera and Sturmfels) associated to the…
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
A topological condition is given, characterizing which closed manifolds in dimensions < 8 (and conjecturally in general) admit symplectic structures. The condition is the existence of a certain fibration-like structure called a hyperpencil.…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…
First, we prove a special case of Knaster's problem, implying that each symmetric convex body in R^3 admits an inscribed cube. We deduce it from a theorem in equivariant topology, which says that there is no S_4-equivariant map from SO(3)…
This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…
We define obstructions which obstruct topological pseudo-isotopies from being isotopic to isotopies in dimension four. These match the smooth obstructions of Hatcher-Wagoner for smooth pseudo-isotopies, and accordingly are valued in certain…
We study Forman--Ricci and effective resistance curvatures on the skeleta of convex polytopes. Our guiding questions are: how frequently do polytopal graphs exhibit everywhere positive curvature, and what structural constraints does…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…