The purity of set-systems related to Grassmann necklaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

The purity of set-systems related to Grassmann necklaces


Studying the problem of quasicommuting quantum minors, Leclerc and Zelevinsky introduced in 1998 the notion of weakly separated sets in $[n]:=\{1,\ldots, n\}$. Moreover, they raised several conjectures on the purity for this symmetric relation, in particular, on the Boolean cube $2^{[n]}$. In 0909.1423[math.CO] we proved these purity conjectures for the Boolean cube $2^{[n]}$, the discrete Grassmanian $\binom{[n]}{r}$, and some other set-systems. Oh, Postnikov, and Speyer in arxiv:1109.4434 proved the purity for weakly separated collections inside a positroid which contain a Grassmann necklace $\mathcal {N}$ defining the positroid. We denote such set-systems as $\mathcal{Int}(\mathcal {N} )$. In this paper we give an alternative (and shorter) proof of the purity of $\mathcal{Int}(\mathcal {N} )$ and present a stronger result. More precisely, we introduce a set-system $\mathcal{Out}(\mathcal {N} )$ complementary to $\mathcal{Int}(\mathcal {N })$, in a sense, and establish its purity. Moreover, we prove (Theorem~3) that these two set-systems are weakly separated from each other. As a consequence of Theorem~3, we obtain the purity of set-systems related to pairs of weakly separated necklaces (Proposition 4 and Corollaries 1 and 2). Finally, we raise a conjecture on the purity of both the interior and exterior of a generalized necklace.
Fichier principal
Vignette du fichier
dmAT0118.pdf (321.75 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01207584 , version 1 (01-10-2015)



Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. The purity of set-systems related to Grassmann necklaces. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.193-204, ⟨10.46298/dmtcs.2392⟩. ⟨hal-01207584⟩


100 View
547 Download



Gmail Facebook X LinkedIn More