Counting (3+1) - Avoiding permutations

Details Counting (3+1) - Avoiding permutations Counting (3+1) - Avoiding permutations

2011-02-28

arxiv.org/abs/1102.5568v1

Mathematics

Combinatorics

17 pages

Scientific paper

A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their appearance in the $(\3+\1)$-free Conjecture of Stanley and Stembridge. The dimension 2 posets $P$ are exactly the ones which have an associated permutation $\pi$ where $i\prec j$ in $P$ if and only if $i

Affiliated with

Also associated with

No associations

Rating

Counting (3+1) - Avoiding permutations 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 Counting (3+1) - Avoiding permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting (3+1) - Avoiding permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424316