Related papers: Constructions for 4-Polytopes and the Cone of Flag…

For $d \ge 2$, we show that all graphs of $d$-polytopes have a Hamiltonian line graph if and only if $d \ne 3$: We exhibit a graph of a $3$-polytope on $252$ vertices whose line graph does not even have Hamiltonian paths. Adapting a…

We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…

The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…

The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

What is the minimal closed cone containing all $f$-vectors of cubical $d$-polytopes? We construct cubical polytopes showing that this cone, expressed in the cubical $g$-vector coordinates, contains the nonnegative $g$-orthant, thus…

In this paper, we present the construction of a geometric object, called a generalized flag geometry, $(X^+;X^-)$, corresponding to a (2k +1)-graded Lie algebra $g=g_k\oplus\dots\oplus g_{-k}$. We prove that $(X^+;X^-) can be realized…

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…

This paper defines for each object $X$ that can be constructed out of a finite number of vertices and cells a vector $fX$ lying in a finite dimensional vector space. This is the flag vector of $X$. It is hoped that the quantum topological…

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

Based on the construction of polytope functions and several results about them in [LP], we take a deep look on their mutation behaviors to find a link between a face of a polytope and a sub-cluster algebra of the corresponding cluster…

The closure of the convex cone generated by all flag $f$-vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of…

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

We construct an infinite family of 4-polytopes whose realization spaces have dimension smaller or equal to 96. This in particular settles a problem going back to Legendre and Steinitz: whether and how the dimension of the realization space…