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

TL;DR
This paper investigates weakly separated collections related to fixed sets, establishing maximality conditions, deriving formulas for their size, and applying these results to cluster algebra structures on Grassmannians.
Contribution
It proves maximality of weakly separated collections under generic conditions and provides formulas for their sizes, advancing understanding of cluster distances in Grassmannian cluster algebras.
Findings
Maximal weakly separated collections are also maximal by size under generic conditions.
Derived a formula for the size of weakly separated collections based on fixed sets.
Calculated exact cluster and mutation distances for certain cluster variables.
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 of sets that are weakly separated from two fixed sets and . We show that all maximal by inclusion weakly separated collections are also maximal by size, provided that and are sufficiently "generic". We also give a simple formula for the cardinality of in terms of and . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
