نتایج جستجو برای: shellable complex

تعداد نتایج: 783934  

2007
VICTOR REINER PETER WEBB

We study a combinatorially-defined double complex structure on the ordered chains of any simplicial complex. Its columns are related to the cell complex Kn whose face poset is isomorphic to the subword ordering on words without repetition from an alphabet of size n. This complex is shellable and as an application we give a representation theoretic interpretation for derangement numbers and a re...

2017
SERGI ELIZALDE PETER R. W. MCNAMARA

The consecutive pattern poset is the infinite partially ordered set of all permutations where σ ≤ τ if τ has a subsequence of adjacent entries in the same relative order as the entries of σ. We study the structure of the intervals in this poset from topological, poset-theoretic, and enumerative perspectives. In particular, we prove that all intervals are rank-unimodal and strongly Sperner, and ...

2008
Jay Schweig

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

Journal: :Transactions of the American Mathematical Society 1997

Journal: :J. Comb. Theory, Ser. A 2005
Valery B. Mnukhin Johannes Siemons

Among shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p -rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of sat...

Journal: :Discrete and Computational Geometry 2021

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. complex expose large amount information helpful way, but are not easy to construct, often requiring deep about the structure complex. It is natural ask whether shellings may be efficiently found computationally. In recent paper, Goaoc, Pat\'ak, Pat\'akov\'a, Tancer Wagner gave negative ans...

2000
ART M. DUVAL LAUREN L. ROSE

We develop an iterated homology theory for simplicial complexes. This theory is a variation on one due to Kalai. For 1 a simplicial complex of dimension d − 1, and each r = 0, . . . , d , we define r th iterated homology groups of 1. When r = 0, this corresponds to ordinary homology. If 1 is a cone over 1′, then when r = 1, we get the homology of 1′. If a simplicial complex is (nonpure) shellab...

Journal: :Transactions of the American Mathematical Society 1996

Journal: :Advances in Mathematics 2017

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید