Obstructions to shellability (Q1293353): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q172221 |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Valeriy B.Mnukhin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/9707216 / rank | |||
Normal rank |
Latest revision as of 19:03, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Obstructions to shellability |
scientific article |
Statements
Obstructions to shellability (English)
0 references
3 July 2000
0 references
An obstruction to shellability is a nonshellable simplicial complex all of whose proper induced subcomplexes are shellable. (Note that here shellability refers to the general notion of nonpure shellability introduced by \textit{A.~Björner} and \textit{M.~Wachs} [Trans. Am. Math. Soc. 348, No. 4, 1299-1327 (1996; Zbl 0857.05102); ibid. 349, No. 10, 3945-3975 (1997; Zbl 0886.05126)].) As has been noticed by R.~Stanley, there is an obstruction to shellability of any dimension. It is an open problem to determine whether or not there is a finite number of obstructions of a fixed dimension \(d\). In the paper under review this problem is solved for \(d=1,2\) and its main result is: Theorem 3. The number of vertices in a two-dimensional obstruction is \(5\), \(6\) or \(7\). Another result is \textit{CL}-shellability of interval orders, which yields as a consequence a recursive formula for the Betti numbers of any interval order.
0 references
interval order
0 references
simplicial complex
0 references
partially ordered set
0 references
matroid complex
0 references
order complex
0 references
shellability
0 references