2008
DOI: 10.1016/j.exmath.2008.06.002
|View full text |Cite
|
Sign up to set email alerts
|

Lower bound theorem for normal pseudomanifolds

Abstract: In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected triangulated manifolds. MSC 2000: 57Q15; 57R05.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
58
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 29 publications
(58 citation statements)
references
References 14 publications
0
58
0
Order By: Relevance
“…In the rest of the paper, we denote by G d the set of complexes that is either the join of ∂σ i and ∂σ d−i , where 2 ≤ i ≤ d − 2, or the join of ∂σ d−2 and a cycle. The following lemma is a special case of Theorem 1(a) in [4]. We give a proof for the sake of completeness.…”
Section: Retriangulations Of Simplicial Complexesmentioning
confidence: 90%
“…In the rest of the paper, we denote by G d the set of complexes that is either the join of ∂σ i and ∂σ d−i , where 2 ≤ i ≤ d − 2, or the join of ∂σ d−2 and a cycle. The following lemma is a special case of Theorem 1(a) in [4]. We give a proof for the sake of completeness.…”
Section: Retriangulations Of Simplicial Complexesmentioning
confidence: 90%
“…(More generally, S d n usually denotes an n-vertex triangulation of the d-sphere.) From the definition of a stacked sphere, one can deduce the following (this also follows from [4,Lemmas 4…”
Section: Preliminaries On Stacked and Tight Triangulationsmentioning
confidence: 90%
“…A bijection ψ : σ 1 → σ 2 is said to be admissible (cf. [3]) if for all vertices x ∈ σ 1 the edge distance between x and ψ(x) in the graph of ∆ is at least three. If ψ is an admissible bijection between σ 1 and σ 2 then we can form a new simplicial complex by identifying all faces ρ 1 ⊆ σ 1 , ρ 2 ⊆ σ 2 such that ψ maps ρ 1 bijectively onto ρ 2 .…”
Section: Constructionsmentioning
confidence: 99%