DOAJ Open Access 2020

Weak Separation, Pure Domains and Cluster Distance

Miriam Farber Pavel Galashin

Abstrak

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.

Topik & Kata Kunci

Penulis (2)

M

Miriam Farber

P

Pavel Galashin

Format Sitasi

Farber, M., Galashin, P. (2020). Weak Separation, Pure Domains and Cluster Distance. https://doi.org/10.46298/dmtcs.6343

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6343
Informasi Jurnal
Tahun Terbit
2020
Sumber Database
DOAJ
DOI
10.46298/dmtcs.6343
Akses
Open Access ✓