Related papers: Balanced complexes and complexes without large mis…

Abstract polytopes are a combinatorial generalization of convex and skeletal polytopes. Counting how many flag orbits a polytope has under its automorphism group is a way of measuring how symmetric it is. Polytopes with one flag orbit are…

Given any finite simplicial complex \Delta, we show how to construct a new simplicial complex \Delta_{\chi} that is balanced and vertex decomposable. Moreover, we show that the h-vector of the simplicial complex \Delta_{\chi} is precisely…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

In this article we investigate the shellability of the flag simplicial complexes attached to non-simple and thin polyominoes. As a consequence, we obtain the Cohen-Macaulayness and a combinatorial interepetation of the $h$-polynomial of the…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

The purpose of this article is to classify the real hypersurfaces in complex space forms of dimension 2 that are both Levi-flat and minimal. The main results are as follows: When the curvature of the complex space form is nonzero, there is…

A relative simplicial complex is a collection of sets of the form $\Delta \setminus \Gamma$, where $\Gamma \subset \Delta$ are simplicial complexes. Relative complexes played key roles in recent advances in algebraic, geometric, and…

Kalai conjectured that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $d-1$, then the graph of $P$ and the space of affine $2$-stresses of $P$ determine $P$ up to affine equivalence. We propose a…

We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…

We introduce the class $\Sigma_k(d)$ of $k$-stellated (combinatorial) spheres of dimension $d$ ($0 \leq k \leq d + 1$) and compare and contrast it with the class ${\cal S}_k(d)$ ($0 \leq k \leq d$) of $k$-stacked homology $d$-spheres. We…

A colored complex of type $\mathbf{a} = (a_1, \dots, a_n)$ is a simplicial complex ${\Delta}$ on a vertex set $V$, together with an ordered partition $(V_1, \dots, V_n)$ of $V$, such that every face $F$ of ${\Delta}$ satisfies $|F \cap V_i|…

A conjecture of Kalai and Eckhoff that the face vector of an arbitrary flag complex is also the face vector of some particular balanced complex is verified.

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

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 prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the…