Name
Abstract | ||
|---|---|---|
Several important simplicial complexes including matroid complexes and broken circuit complexes are known to be shellable. We show that the lexicographic order of the bases of a matroid can be reversed to obtain a shelling. We prove that the h-vectors of such reversibly shellable complexes of rank d, which have an empty boundary must satisfy the inequality h(0) + h(1) +...+ h(i) less than or equal to h(d) + h(d-1) +...+ h(d-i) for i less than or equal to[d/2]. In particular, this gives a necessary condition for the h-vector of matroids without coloops. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00083-9 | DISCRETE MATHEMATICS |
Keywords | Field | DocType |
satisfiability,simplicial complex,circuit complexity,lexicographic order | Matroid,Discrete mathematics,Combinatorics,Lexicographical order,Mathematics | Journal |
Volume | Issue | ISSN |
159 | 1-3 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manoj K. Chari | 1 | 57 | 9.17 |