Miriam Farber ; Pavel Galashin - Weak Separation, Pure Domains and Cluster Distance

dmtcs:6343 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6343
Weak Separation, Pure Domains and Cluster DistanceArticle

Authors: Miriam Farber 1; Pavel Galashin 1

  • 1 Department of Mathematics [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.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • Graduate Research Fellowship Program; Funder: National Science Foundation; Code: 1122374

5 Documents citing this article

Consultation statistics

This page has been seen 200 times.
This article's PDF has been downloaded 215 times.