Related papers: Balanced complexes and complexes without large mis…
Given a combinatorial $(d-1)$-sphere $S$, to construct a combinatorial $d$-sphere $S^{\hspace{.2mm}\prime}$ containing $S$, one usually needs some more vertices. Here we consider the question whether we can do one such construction without…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
A classical result by Pachner states that two $d$-dimensional combinatorial manifolds with boundary are PL homeomorphic if and only they can be connected by a sequence of shellings and inverse shellings. We prove that for balanced, i.e.,…
We analyze a remarkable class of centrally symmetric polytopes, the Hansen polytopes of split graphs. We confirm Kalai's 3^d-conjecture for such polytopes (they all have at least 3^d nonempty faces) and show that the Hanner polytopes among…
We consider families of simple polytopes $P$ and simplicial complexes $K$ well-known in polytope theory and convex geometry, and show that their moment-angle complexes have some remarkable homotopy properties which depend on combinatorics…
Suppose a group $G$ acts properly on a simplicial complex $\Gamma$. Let $l$ be the number of $G$-invariant vertices and $p_1, p_2, ... p_m$ be the sizes of the $G$-orbits having size greater than 1. Then $\Gamma$ must be a subcomplex of…
We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…
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$,…
A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…
The main invariant to study the combinatorics of a simplicial complex $K$ is the associated face ring or Stanley-Reisner algebra. Reisner respectively Stanley explained in which sense Cohen-Macaulay and Gorenstein properties of the face…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…
We prove that a simplicial 2-sphere satisfying a certain condition is the underlying simplicial complex of a 3-dimensional non-singular complete fan. In particular, this implies that any simplicial 2-sphere with $\leq 18$ vertices is the…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
This paper continues investigation of the class of flag simple polytopes called 2-truncated cubes. It is an extended version of the short note Volodin (2012). A 2-truncated cube is a polytope obtained from a cube by sequence of truncations…
An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…
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…
A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…
Using an intuition from metric geometry, we prove that any flag and normal simplicial complex satisfies the non-revisiting path conjecture. As a consequence, the diameter of its facet-ridge graph is smaller than the number of vertices minus…
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes…