Related papers: Polytopal Bier spheres and Kantorovich-Rubinstein …

A Bier sphere $Bier(K) = K\ast_\Delta K^\circ$, defined as the deleted join of a simplicial complex and its Alexander dual $K^\circ$, is a purely combinatorial object (abstract simplicial complex). Here we study a hidden geometry of Bier…

The construction of the Bier sphere Bier(K) for a simplicial complex K is due to Bier. Bj\"orner, Paffenholz, Sj\"ostrand and Ziegler generalize this construction to obtain a Bier poset Bier(P,I) from any bounded poset P and any proper…

We prove that a Murai sphere is flag if and only if it is a nerve complex of a flag nestohedron and classify all the polytopes arising in this way. Our classification implies that flag Murai spheres satisfy the Nevo-Petersen conjecture on…

In 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of simplicial spheres. He proved that, for any simplicial complex $\Delta$ on the vertex set $V$ with $\Delta \ne 2^V$, the deleted join of $\Delta$ with…

Full subcomplexes of a simplicial complex encode essential structure for understanding the complex itself. For a simplicial complex $K$, possibly with a ghost vertex, the Bier sphere of $K$ is a simplicial sphere obtained as the deleted…

We construct many nonpolytopal nonsimplicial Gorenstein* meet semi-lattices with nonnegative toric g-vector, supporting a conjecture of Stanley. These are formed as Bier spheres over the face posets of multiplexes, polytopes constructed by…

We compute the real and complex Buchstaber numbers of an arbitrary Bier sphere. In dimension two, we identify all the 13 different combinatorial types of Bier spheres and show that 12 of them are nerve complexes of nestohedra, while the…

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n-2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his…

We give a simple proof that some iterated derived subdivision of every PL sphere is combinatorially equivalent to the boundary of a simplicial polytope, thereby resolving a problem of Billera (personal communication).

We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero…

We prove that the median hypersimplex $\Delta_{2k,k}$ is Minkowski indecomposable, i.e. it cannot be expressed as a non-trivial Minkowski sum $\Delta_{2k,k} = P+Q$, where $P\neq \lambda\Delta_{2k,k}\neq Q$. We obtain as a corollary that…

A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani in 1987, via a non-constructive proof…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique 3-sphere with the parameters $(f_0,f_1,f_2,f_3;f_{02})=(12,40,40,12;120)$, but this sphere is not…

In this paper we study various scribability problems for polytopes. We begin with the classical $k$-scribability problem proposed by Steiner and generalized by Schulte, which asks about the existence of $d$-polytopes that cannot be realized…

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

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…

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…