English

Weak Separation, Pure Domains and Cluster Distance

Combinatorics 2018-07-11 v1

Abstract

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\mathcal A_{I,J} of sets that are weakly separated from two fixed sets II and JJ. We show that all maximal by inclusion weakly separated collections WAI,J\mathcal W\subset\mathcal A_{I,J} are also maximal by size, provided that II and JJ are sufficiently "generic". We also give a simple formula for the cardinality of W\mathcal W in terms of II and JJ. 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.

Keywords

Cite

@article{arxiv.1612.05387,
  title  = {Weak Separation, Pure Domains and Cluster Distance},
  author = {Miriam Farber and Pavel Galashin},
  journal= {arXiv preprint arXiv:1612.05387},
  year   = {2018}
}

Comments

44 pages, 11 figures

R2 v1 2026-06-22T17:25:48.806Z