Symmetric Chain Decomposition of Necklace Posets
نویسندگان
چکیده
منابع مشابه
Symmetric Chain Decomposition of Necklace Posets
A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If P is any symmetric chain order, we prove that P/Zn is also a symmetric chain order, where Zn acts on Pn by cyclic permutation of the factors.
متن کاملThe necklace poset is a symmetric chain order
Let Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence under rotation. Griggs, Killian, and Savage proved that Np is a symmetric chain order for prime p. In this paper, we settle the question of whether this poset is a symmetric chain order for all n by providing an algorithm that produces a symmetric chain decompostion (or SCD). We accomplish this by modify...
متن کاملM-chain graphs of posets
Covering graphs of various types of finite partially ordered sets have been extensively studied since Ore in [2] asked for a characterization of such graphs in general. In this note we introduce a graph, called the m-chain graph of a poset, that reduces to the covering graph when m = 1. Since we will show how to construct the m-chain graph for m > 2 as the 2-chain graph of another poset, we are...
متن کاملSecond symmetric powers of chain complexes
We investigate Buchbaum and Eisenbud's construction of the second symmetric power $s_R(X)$ of a chain complex $X$ of modules over a commutative ring $R$. We state and prove a number of results from the folklore of the subject for which we know of no good direct references. We also provide several explicit computations and examples. We use this construction to prove the following vers...
متن کاملA Symmetric Chain Decomposition of L(4, n)
aw-d is the set of integer m-tuples (a1 ☺ l **t ",) with o 5 al < .*. < am 5 n , ordered by a < b when ai 5 bi for all i . w-s R. Stanley conjectured that L(m,n) is a symmetric chain order for all (m,n) . We verify this by construction for m = 4 . Research supported in part by NSF grant MCS 77-23738 and Office of Naval Research contract ~00014~76-c-0688. Reproduction in whole or in part is perm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/1178