On maximal weakly separated set-systems
Combinatorics
2010-11-15 v2 Representation Theory
Abstract
For a permutation , Leclerc and Zelevinsky \cite{LZ} introduced a concept of -{\em chamber weakly separated collection} of subsets of and conjectured that all inclusion-wise maximal collections of this sort have the same cardinality , where is the length of . We answer affirmatively this conjecture and present a generalization and additional results.
Cite
@article{arxiv.0909.1423,
title = {On maximal weakly separated set-systems},
author = {Vladimir I. Danilov and Alexander V. Karzanov and Gleb A. Koshevoy},
journal= {arXiv preprint arXiv:0909.1423},
year = {2010}
}
Comments
36 pages. This is the final version for J. Algebr. Comb