Related papers: Combinatorics of flag simplicial 3-polytopes
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…
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…
It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…
A $k$-orbit maniplex is one that has $k$ orbits of flags under the action of its automorphism group. In this paper we extend the notion of symmetry type graphs of maps to that of maniplexes and polytopes and make use of them to study…
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type…
We consider an interesting class of combinatorial symmetries of polytopes which we call \emph{edge-length preserving combinatorial symmetries}. These symmetries not only preserve the combinatorial structure of a polytope but also map each…
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…
For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…
For any flag simplicial complex $\Theta$ obtained by stellar subdividing the boundary of the cross polytope in edges, we define a flag simplicial complex $\Gamma(\Theta)$ (dependent on the sequence of subdivisions) whose $f$-vector is the…
The $r$-fold edgewise subdivision is a well studied flag triangulation of the simplex with interesting algebraic, combinatorial and geometric properties. An important enumerative invariant, namely the local $h$-polynomial, of this…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
If $K$ is a simplicial complex on $m$ vertices the flagification of $K$ is the minimal flag complex $K^f$ on the same vertex set that contains $K$. Letting $L$ be the set of vertices, there is a sequence of simplicial inclusions $L\to K\to…
The full root polytope of type $A$ is the convex hull of all pairwise differences of the standard basis vectors which we represent by forward and backward arrows. We completely classify all flag triangulations of this polytope that are…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
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…
Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…
Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…
The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…
We consider a class of right-angled Coxeter orbifolds, named as simple orbifolds, which are a generalization of simple polytopes. Similarly to manifolds over simple polytopes, the topology and geometry of manifolds over simple orbifolds are…