Related papers: Lower bounds on the $g$-numbers of spheres without…

For $d\geq 4$, Kalai (1987) characterized all simplicial $(d-1)$-spheres with $g_2=0$, and for $k\geq 2$ and $d\geq 2k$, Murai and Nevo (2013) characterized all simplicial $(d-1)$-spheres with $g_k=0$. In addition, for $d\geq 4$, Nevo and…

For a $(d-1)$-dimensional simplicial complex $\Delta$ and $1\leq i\leq d$, let $f_{i-1}$ be the number of $(i-1)$-faces of $\Delta$ and $m_i$ be the number of missing $i$-faces of $\Delta$. In the nineties, Kalai asked for a…

The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…

We characterize normal $3$-pseudomanifolds with $g_2\leq4$. We know that if a $3$-pseudomanifold with $g_2\leq4$ does not have any singular vertices then it is a $3$-sphere. We first prove that a normal $3$-pseudomanifold with $g_2\leq4$…

We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…

A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…

We prove a relatively simple combinatorial characterization of simplicial $d$-spheres on $d+4$ vertices. Our criteria are given in terms of the intersection patterns of a simplicial complex's family of minimal non-faces. Namely, let…

Let $\mathscr{X}$ be the boundary complex of a $(d+1)$-polytope, and let $\rho(d+1,k) = \frac{1}{2}[{\lceil (d+1)/2 \rceil \choose d-k} + {\lfloor (d+1)/2 \rfloor \choose d-k}]$. Recently, the author, answering B\'ar\'any's question from…

The $g$-vector of a simplicial complex contains a lot of information about the combinatorial and topological structure of that complex. Several classification results regarding the structure of normal pseudomanifolds and homology manifolds…

The result of Padrol asserts that for every $d\geq 4$, there exist $2^{\Omega(n\log n)}$ distinct combinatorial types of $\lfloor d/2\rfloor$-neighborly simplicial $(d-1)$-spheres with $n$ vertices. We present a construction showing that…

We characterize homology manifolds with $g_2\leq 2$. Specifically, using retriangulations of simplicial complexes, we give a short proof of Nevo and Novinsky's result on the characterization of homology $(d-1)$-spheres with $g_2=1$ for…

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

In this note we construct a flag simplicial $3$-sphere $\Delta$ with the following properties: - $\Delta$ is not a suspension; - $\Delta$ has no edge that can be contracted to obtain another flag sphere; - The only equators (induced…

Let \Delta be a (d-1)-dimensional homology sphere on n vertices with m minimal non-faces. We consider the invariant \alpha := m - (n-d) and prove that for a given value of \alpha, there are only finitely many homology spheres that cannot be…

Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a discrete d-manifold G is sandwiched between…

The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

We start by providing a very simple and elementary new proof of the classical bound due to J. Beck which states that the spherical cap $\mathbb{L}_2$-discrepancy of any $N$ points on the unit sphere $\mathbb S^d$ in $\mathbb{R}^{d+1}$,…