نتایج جستجو برای: poset
تعداد نتایج: 2143 فیلتر نتایج به سال:
A classic problem connecting algebraic and geometric combinatorics is the realization problem: given a poset, determine whether there exists polytope whose face lattice poset. In 1990s, Kapranov defined poset as hybrid between of permutohedron that an associahedron, he asked this realizable. Shortly after his question was posed, Reiner Ziegler provided realization. Based on our previous work ne...
In this paper X denotes a set. Let L be a lattice. Note that Poset(L) has l.u.b.’s and g.l.b.’s. Let L be an upper-bounded lattice. One can verify that Poset(L) is upper-bounded. Let L be a lower-bounded lattice. One can verify that Poset(L) is lower-bounded. Let L be a complete lattice. Note that Poset(L) is complete. Let X be a set. Then X is an order in X . Let X be a set. The functor 〈X ,⊆〉...
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید