Following the proof of the purity conjecture for weakly separated collections, recent years have revealed a variety of wider examples of purity in different settings. In this paper we consider the collection AI,J of sets that are weakly separated from two fixed sets I and J. We show that all maximal by inclusion weakly separated collections W ⊂A I, J are also maximal by size, provided that I and J are sufficiently “generic”. We also give a simple formula for the cardinality of Win terms of I and J. We apply our result to calculate the cluster distance and to give lower bounds on the mutation distance between cluster variables in the cluster algebra structure on the coordinate ring of the Grassmannian. Using a linear projection that relates...
A set X is said to properly intersect a set Y if none of the sets X ∩ Y , X\Y and Y \X is empty. In ...
This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial func...
In this paper we define new types of sets we call them , −, −, −, −, and − −sets and use them to def...
Abstract Following the proof of the purity conjecture for weakly separated collection...
Abstract. We present a short proof that every maximal family of weakly separated subsets of [n] of c...
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain com...
Studying the problem of quasi-commuting quantum minors, Leclerc and Zelevinsky [3] introduced the no...
Alexander Postnikov and David E. Speyer Leclerc and Zelevinsky described quasicommuting families of ...
There are several well known bijections between classes of dissimilarity coefficients and structures...
AbstractThere are several well known bijections between classes of dissimilarity coefficients and st...
We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate...
International audiencePlabic graphs are combinatorial objects used to study the totally nonnegative ...
Sub-dominant theory provides efficient tools for clustering. However it classically works only for u...
AbstractA point set is separated if the minimum distance between its elements is one. Two numbers ar...
The k-weak hierarchies, for k ≥ 2, are the cluster collections such that the intersection of any (k ...
A set X is said to properly intersect a set Y if none of the sets X ∩ Y , X\Y and Y \X is empty. In ...
This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial func...
In this paper we define new types of sets we call them , −, −, −, −, and − −sets and use them to def...
Abstract Following the proof of the purity conjecture for weakly separated collection...
Abstract. We present a short proof that every maximal family of weakly separated subsets of [n] of c...
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain com...
Studying the problem of quasi-commuting quantum minors, Leclerc and Zelevinsky [3] introduced the no...
Alexander Postnikov and David E. Speyer Leclerc and Zelevinsky described quasicommuting families of ...
There are several well known bijections between classes of dissimilarity coefficients and structures...
AbstractThere are several well known bijections between classes of dissimilarity coefficients and st...
We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate...
International audiencePlabic graphs are combinatorial objects used to study the totally nonnegative ...
Sub-dominant theory provides efficient tools for clustering. However it classically works only for u...
AbstractA point set is separated if the minimum distance between its elements is one. Two numbers ar...
The k-weak hierarchies, for k ≥ 2, are the cluster collections such that the intersection of any (k ...
A set X is said to properly intersect a set Y if none of the sets X ∩ Y , X\Y and Y \X is empty. In ...
This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial func...
In this paper we define new types of sets we call them , −, −, −, −, and − −sets and use them to def...