English

On maximal weakly separated set-systems

Combinatorics 2010-11-15 v2 Representation Theory

Abstract

For a permutation ωSn\omega\in S_n, Leclerc and Zelevinsky \cite{LZ} introduced a concept of ω\omega-{\em chamber weakly separated collection} of subsets of {1,2,...,n}\{1,2,...,n\} and conjectured that all inclusion-wise maximal collections of this sort have the same cardinality (ω)+n+1\ell(\omega)+n+1, where (ω)\ell(\omega) is the length of ω\omega. 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

R2 v1 2026-06-21T13:43:49.093Z