The purity of set-systems related to Grassmann necklaces

نویسندگان

  • Vladimir I. Danilov
  • Alexander V. Karzanov
  • Gleb A. Koshevoy
چکیده

Studying the problem of quasi-commuting quantum minors, Leclerc and Zelevinsky [3] introduced the notion of weakly separated sets in [n] := {1, . . . , n}. They raised conjectures on the purity, with respect to this weakly separation relation, of certain set-systems. In particular, a conjecture on the purity of the whole Boolean cube 2; equivalently: on the max-clique purity of the graph on 2 whose edges are generated by this relation. (Here a finite graph G is called pure if all (inclusion-wise) maximal cliques in it have the same cardinality.) Answering those conjectures, [1] proved the purity of 2 and some other set-systems, including the discrete Grassmannian ( [n] r ) . In [5] the purity was proved for a certain weakly separated set-system inside the so-called positroid defined by a Grassmann necklace N . We denote this set-system as Int(N ). It is a special collection in the discrete Grassmannian, and the whole discrete Grassmannian is obtained by considering the ‘largest’ necklace. In this paper we give an alternative (and shorter) proof of the purity of Int(N ) and present a stronger result. More precisely, we introduce a set-system Out(N ) complementary to Int(N ), in a sense, and establish its purity. This is a consequence of the result (Theorem 3) that the set-systems Int(N ) and Out(N ) are weakly separated from each other, which means that any element of the former is weakly separated from any element of the latter. To prove this, we use a technique of plabic tilings from [5]. As one more consequence of Theorem 3, we also demonstrate the purity of set-systems related to pairs of weakly separated necklaces (Proposition 4 and Corollaries 1 and 2). Finally, we introduce a notion of generalized necklaces and claim the purity of the corresponding interior and exterior set-systems related to them; this extends the statement of Theorem 3. (This claim and a further generalization were recently shown in [2]. Note that results in [2] and [6] give rise to a cluster algebra structure on the interior and exterior of a generalized necklace. However, the natural questions on a positroid concerning the purity and the existence of a cluster algebra structure are still open.)

منابع مشابه

Application of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)

Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...

متن کامل

Reciprocal Degree Distance of Grassmann Graphs

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

متن کامل

Hamilton-Jakobi method for classical mechanics in Grassmann algebra

The problem of Lagrangian and Hamiltonian mechanics with Grassmann variables has been discussed previously in works [1, 2, 3] and an examples of solutions for classical systems were presented. In this paper we propose the Hamilton-Jakobi method for the solution of the classical counterpart of Witten‘s model [4]. We assume that the states of mechanical system are described by the set of ordinary...

متن کامل

Rcd Rules and Power Systems Observability

Power system state estimation is a process to find the bus voltage magnitudes and phase angles at every bus based on a given measurement set. The state estimation convergency is related to the sufficiency of the measurement set. Observability analysis actually tests this kind of problem and guarantees the state estimation accuracy. A new and useful algorithm is proposed and applied in this pape...

متن کامل

On Necklaces inside Thin Subsets of R

We study similarity classes of point configurations in R. Given a finite collection of points, a well-known question is: How high does the Hausdorff dimension dimH(E) of a compact set E ⊂ R, d ≥ 2, need to be to ensure that E contains some similar copy of this configuration? We prove results for a related problem, showing that for dimH(D) sufficiently large, E must contain many point configurat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014