نتایج جستجو برای: shellable complex
تعداد نتایج: 783934 فیلتر نتایج به سال:
We show that an ’almost strong Lefschetz’ property holds for the barycentric subdivision of a shellable complex. From this we conclude that for the barycentric subdivision of a CohenMacaulay complex, the h-vector is unimodal, peaks in its middle degree (one of them if the dimension of the complex is even), and that its g-vector is an M -sequence. In particular, the (combinatorial) g-conjecture ...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S×S and 615 triangulations of the twisted sphere product S×S. All the 3-spheres with up to 10 vertices are shellable, but there are 29 vertexminimal non-shellable 3-balls with 9 vertices.
We prove that if a simplicial complex ∆ is shellable, then the intersection lattice L∆ for the corresponding diagonal arrangement A∆ is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on the data of shelling. Also, we give some examples of diagonal arrangements A where the complement MA is K(π, 1), coming from rank 3 matroids.
In this paper we construct from a cographic matroid M , a pure multicomplex whose degree sequence is the h–vector of the the matroid complex of M. This result proves a conjecture of Richard Stanley [Sta96] in the particular case of cographic matroids. We also prove that the multicomplexes constructed are M–shellable, so proving a conjecture of Manoj Chari [Cha97] again in the case of cographic ...
For a simplicial complex 2 and coefficient domain F let F2 be the F-module with basis 2. We investigate the inclusion map given by : { [ _1+_2+_3+ } } } +_k which assigns to every face { the sum of the co-dimension 1 faces contained in {. When the coefficient domain is a field of characteristic p>0 this map gives rise to homological sequences. We investigate this modular homology for shellable ...
The Harary-Hill Conjecture states that the number of crossings in any drawing of the complete graph Kn in the plane is at least Z(n) := 1 4 ⌊ n 2 ⌋ ⌊ n−1 2 ⌋ ⌊ n−2 2 ⌋ ⌊ n−3 2 ⌋ . In this paper, we settle the Harary-Hill conjecture for shellable drawings. We say that a drawing D of Kn is s-shellable if there exist a subset S = {v1, v2, . . . , vs} of the vertices and a region R of D with the fo...
We consider a simplicial complex generaliztion of a result of Billera and Meyers that every nonshellable poset contains the smallest nonshellable poset as an induced subposet. We prove that every nonshellable 2-dimensional simplicial complex contains a nonshellable induced subcomplex with less than 8 vertices. We also establish CL-shellability of interval orders and as a consequence obtain a fo...
After [4] the shellability of multicomplexes Γ is given in terms of some special faces of Γ called facets. Here we give a criterion for the shellability in terms of maximal facets. Multigraded pretty clean filtration is the algebraic counterpart of a shellable multicomplex. We give also a criterion for the existence of a multigraded pretty clean filtration.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید