Symmetric chain decomposition of necklace posets

Details Symmetric chain decomposition of necklace posets Symmetric chain decomposition of necklace posets

2011-04-21

arxiv.org/abs/1104.4147v2

Mathematics

Combinatorics

9 pages

Scientific paper

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^n/\mathbb{Z}_n$ is also a symmetric
chain order, where $\mathbb{Z}_n$ acts on $P^n$ by cyclic permutation of the
factors.

Affiliated with

Also associated with

No associations

Rating

Symmetric chain decomposition of necklace posets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetric chain decomposition of necklace posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric chain decomposition of necklace posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-177647