The purity of set-systems related to Grassmann necklaces

From MaRDI portal
Publication:4584100

zbMATH Open1393.05256arXiv1312.3121MaRDI QIDQ4584100FDOQ4584100

G. A. Koshevoy, Vladimir I. Danilov, Alexander V. Karzanov

Publication date: 29 August 2018

Abstract: 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 [n]chooser, 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 mathcalN defining the positroid. We denote such set-systems as mathcalInt(mathcalN). In this paper we give an alternative (and shorter) proof of the purity of mathcalInt(mathcalN) and present a stronger result. More precisely, we introduce a set-system mathcalOut(mathcalN) complementary to mathcalInt(mathcalN), 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.


Full work available at URL: https://arxiv.org/abs/1312.3121




Recommendations




Cited In (2)





This page was built for publication: The purity of set-systems related to Grassmann necklaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584100)