Proceedings of the 28-th International Conference on Formal Power Series and Algebraic Combinatorics
4-8 Jul 2016 Vancouver, British Columbia (Canada)
Tuesday 5
Combinatorics
Eric Fusy
› 17:30 - 19:00 (1h30)
› SFU Harbour Center - Segal Centre Conference Rooms 1400 - 1410
Weak Separation, Pure Domains and Cluster Distance
Miriam Farber  1  , Pavel Galashin  1  
1 : Dept of Math, Massachusetts Institute of technology [Cambridge]  (MIT)

Following the proof of the purity conjecture for weakly separated sets, recent years have revealed a variety of wider classes of pure domains in different settings. In this paper we show the purity for domains consisting of sets that are weakly separated from a pair of “generic” sets I and J. Our proof also gives a simple formula for the rank of these domains in terms of I and J. This is a new instance of the purity phenomenon which essentially differs from all previously known pure domains. 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 weak separation to the octahedron recurrence, we also find the exact mutation distances and cluster distances for a family of cluster variables. 



  • Poster
Online user: 1