相关论文: A non-face characterization of spheres on few vert…

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

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…

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)…

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…

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

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…

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

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 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…

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…

We establish several new lower bounds on the $g$-numbers of simplicial spheres without large missing faces. For this class of spheres, we derive bounds on the $g$-numbers in terms of the independence numbers of their graphs, extending 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 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…

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of 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 construct non-constructible simplicial $d$-spheres with $d+10$ vertices and non-constructible, non-realizable simplicial $d$-balls with $d+9$ vertices for $d\geq 3$.

Let $M$ be an $n$-vertex combinatorial triangulation of a $\ZZ_2$-homology $d$-sphere. In this paper we prove that if $n \leq d + 8$ then $M$ must be a combinatorial sphere. Further, if $n = d + 9$ and $M$ is not a combinatorial sphere then…

Let $\Delta$ be a $g_2$-minimal normal 3-pseudomanifold. A vertex in $\Delta$ whose link is not a sphere is called a singular vertex. When $\Delta$ contains at most two singular vertices, its combinatorial characterization is known [9]. In…

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…