2015
DOI: 10.1016/j.ejc.2014.11.002
|View full text |Cite
|
Sign up to set email alerts
|

A tightness criterion for homology manifolds with or without boundary

Abstract: A simplicial complex X is said to be tight with respect to a field F if X is connected and, for every induced subcomplex Y of X, the linear map H * (Y ; F) → H * (X; F) (induced by the inclusion map) is injective. This notion was introduced by Kühnel in [10]. In this paper we prove the following two combinatorial criteria for tightness. (a) Any (k + 1)neighbourly k-stacked F-homology manifold with boundary is F-tight. Also, (b) any F-orientable (k + 1)-neighbourly k-stacked F-homology manifold without boundary… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
16
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(17 citation statements)
references
References 14 publications
1
16
0
Order By: Relevance
“…The notion of stackedness was introduced by Walkup [23] and McMullen & Walkup [18] in the context of triangulated spheres. The close relationship between stackedness and tightness has been highlighted in [1,5,6,19]. This is further borne out by Theorem 4.8 of this article.…”
Section: Introductionsupporting
confidence: 57%
“…The notion of stackedness was introduced by Walkup [23] and McMullen & Walkup [18] in the context of triangulated spheres. The close relationship between stackedness and tightness has been highlighted in [1,5,6,19]. This is further borne out by Theorem 4.8 of this article.…”
Section: Introductionsupporting
confidence: 57%
“…More precisely, for a k-neighborly complex all τ i with i k − 2 are zero (see Theorem 4.9) and for a k-stacked d-sphere all τ i with k i d − k − 1 are zero (see Theorem 5.6). The first result is due to Bagchi and Datta [8,Lemma 3.9], the second is due to Bagchi [6,Lemma 3]. Going further, we also look at manifolds that are almost 2-neighborly or almost 1-stacked and prove bounds for the entries of their τ -vectors (Theorems 3.12, 5.10 and 5.11).…”
Section: Outline Of the Papermentioning
confidence: 92%
“…For this example, we have (m 0 , m 1 , m 2 ) = (41, 20, 1) (see appendix). Also, we have the following treetypes: (3,2), (3,4), (4, 2), (4, 3), (4, 4)}, ∆(σ 2 , τ 2 ) = {(1, 3), (2, 3), (2, 4), (4, 1), (4, 3), (4, 4)}, where D = {(σ 1 , τ 1 ), (σ 2 , τ 2 )} is the 2-deck of permutations of {0, 1, 2, 3}. It can be seen that we must have, σ 1 = (1, 2, 0, 3), τ 1 = (1, 0, 3, 2); σ 2 = (1, 0, 2, 3), τ 2 = (0, 2, 1, 3).…”
Section: Further Sporadic Examplesmentioning
confidence: 99%
“…∆(σ 3 , τ 3 ) = {(2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3), (4, 5), (5, 2)}, ∆(σ 2 , τ 2 ) = {(1, 1), (1,2), (1,4), (3,2), (3,4), (4, 2), (5, 1), (5,2), (5,4), (5, 5)}, ∆(σ 1 , τ 1 ) = {(2, 4), (3,3), (3,4), (4, 3), (4, 4), (4, 5), (5, 1), (5,3), (5,4), (…”
Section: Treementioning
confidence: 99%
See 1 more Smart Citation