English
Related papers

Related papers: On a construction of some homology $d$-manifolds

200 papers

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…

Combinatorics · Mathematics 2017-07-25 Hailun Zheng

Numerous structural findings of homology manifolds have been derived in various ways in relation to $g_2$-values. The homology $4$-manifolds with $g_2\leq 5$ are characterized combinatorially in this article. It is well-known that all…

Geometric Topology · Mathematics 2024-08-21 Biplab Basak , Sourav Sarkar

Kalai proved that the simplicial polytopes with g_2=0 are the stacked polytopes. We characterize the g_2=1 case. Specifically, we prove that every simplicial d-polytope (d>=4) which is prime and with g_2=1 is combinatorially equivalent…

Combinatorics · Mathematics 2009-12-10 Eran Nevo , Eyal Novinsky

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

Combinatorics · Mathematics 2022-03-25 Biplab Basak , Raju Kumar Gupta

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

Discrete Mathematics · Computer Science 2018-06-19 Oliver Knill

Characterizing face-number-related invariants of a given class of simplicial complexes has been a central topic in combinatorial topology. In this regard, one of the well-known invariants is $g_2$. Let $K$ be a normal $3$-pseudomanifold…

Geometric Topology · Mathematics 2023-07-04 Biplab Basak , Raju Kumar Gupta , Sourav Sarkar

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…

Combinatorics · Mathematics 2025-05-27 Biplab Basak , Raju Kumar Gupta , Sourav Sarkar

The study of face-number-related invariants in simplicial complexes is a central topic in combinatorial topology. Among these, the invariant $g_2$ plays a significant role. For a normal $d$-pseudomanifold $K$ ($d \geq 3$), it is known that…

Combinatorics · Mathematics 2025-05-07 Biplab Basak , Mangaldeep Saha , Sourav Sarkar

A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S^i\times\S^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the…

Combinatorics · Mathematics 2011-02-03 Steven Klee , Isabella Novik

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

Combinatorics · Mathematics 2015-05-13 Christos A. Athanasiadis

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…

Combinatorics · Mathematics 2024-07-02 Kai Fong Ernest Chong , Tiong Seng Tay

In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…

Algebraic Topology · Mathematics 2013-07-23 Emma Connon

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…

Combinatorics · Mathematics 2025-08-04 Shuai Huang , Jasper Miller , Daniel Rose-Levine , Steven Simon

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Geometric Topology · Mathematics 2020-02-18 Biplab Basak , Ed Swartz

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…

Combinatorics · Mathematics 2009-07-13 Michael Goff , Steven Klee , Isabella Novik

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…

Geometric Topology · Mathematics 2012-05-29 Bhaskar Bagchi , Basudeb Datta

We prove that if G is a graph without 3-cycles and 4-cycles, then the discrete cubical homology of G is trivial in dimension d, for all d\ge 2. We also construct a sequence { G_d } of graphs such that this homology is non-trivial in…

Combinatorics · Mathematics 2020-05-18 Helene Barcelo , Curtis Greene , Abdul Salam Jarrah , Volkmar Welker

We present a construction of a canonical G_2 structure on the unit sphere tangent bundle S_M of any given orientable Riemannian 4-manifold M. Such structure is never geometric or 1-flat, but seems full of other possibilities. We start by…

Differential Geometry · Mathematics 2011-12-15 R. Albuquerque , I. M. C. Salavessa

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…

Combinatorics · Mathematics 2026-04-21 Isabella Novik , Hailun Zheng

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Combinatorics · Mathematics 2007-05-23 Svante Linusson , John Shareshian , Volkmar Welker
‹ Prev 1 2 3 10 Next ›