On the purity of maximal weakly separated set families

Details On the purity of maximal weakly separated set families On the purity of maximal weakly separated set families

2011-11-28

arxiv.org/abs/1111.6404v2

Mathematics

Combinatorics

minor typo corrected; example added

Scientific paper

We present a short proof that every maximal family of weakly separated
subsets of $[n]$ of cardinality between $[a,b]$ have the same size. Our proof
is direct and only uses elementary combinatorics of lattice paths.

Affiliated with

Also associated with

No associations

Rating

On the purity of maximal weakly separated set families 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 On the purity of maximal weakly separated set families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the purity of maximal weakly separated set families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67357