Weak Separation, Pure Domains and Cluster Distance - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2020

Weak Separation, Pure Domains and Cluster Distance

Résumé

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.
Fichier principal
Vignette du fichier
final_118.pdf (659.52 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02173376 , version 1 (04-07-2019)

Identifiants

Citer

Miriam Farber, Pavel Galashin. Weak Separation, Pure Domains and Cluster Distance. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6343⟩. ⟨hal-02173376⟩
35 Consultations
441 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More