Related papers: Constructions for 4-Polytopes and the Cone of Flag…
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 describe a construction of plane quartics with prescribed Galois operation on the 28 bitangents, in the particular case of a Galois invariant Cayley octad. As an application, we solve the inverse Galois problem for degree two del Pezzo…
An abstract polytope is chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. There are still few examples of chiral polytopes, and few constructions that can create chiral…
Let $P_n$ be an $n$-dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project $P_n$ onto a random, uniformly distributed linear subspace of dimension $d\geq 2$. We…
This article aims to study the class of strongly self-dual polytopes (ssd-polytopes for short), defined in a paper by Lov\'asz \cite{lovasz}. He described a series of such polytopes (called $L$-type polytopes), which he used to solve a…
Reflexive polytopes in n dimensions have attracted much attention both in mathematics and theoretical physics due to their connection to Fano n-folds and mirror symmetry. This work focuses on the 18 regular reflexive polytopes corresponding…
Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…
The zero locus of a generic section of a vector bundle over a manifold defines a submanifold. A classical problem in geometry asks to realise a specified submanifold in this way. We study two cases; a point in a generalised flag manifold…
We give an alternative proof of a (former) conjecture of Bj\"orner stating that the matrix expressing face numbers in terms of g numbers is totally non-negative. We briefly discuss the case of simple flag polytopes.
Motivated by the search for reduced polytopes, we consider the following question: For which polytopes exists a vertex-facet assignment, that is, a matching between vertices and non-incident facets, so that the matching covers either all…
In this note we prove a theorem concerning the sewing of even dimensional neighbourly polytopes. The theorem provides a fast algorithm for sewing in practice. We also give a description of the universal faces of a sewn $d$-polytope in terms…
We show that all stack-sorting polytopes are simplices. Furthermore, we show that the stack-sorting polytopes generated from $Ln1$ permutations have relative volume 1. We establish an upper bound for the number of lattice points in a…
Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…
For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
We provide a number of new construction techniques for cubical complexes and cubical polytopes, and thus for cubifications (hexahedral mesh generation). As an application we obtain an instance of a cubical 4-polytope that has a…
We study the combinatorial Reeb flow on the boundary of a four-dimensional convex polytope. We establish a correspondence between "combinatorial Reeb orbits" for a polytope, and ordinary Reeb orbits for a smoothing of the polytope,…
Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…