Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Weak Separation, Pure Domains and Cluster Distance

Weak Separation, Pure Domains and Cluster Distance

Thumbnail Image
Download
Name

29_2018_394_ReferencePDF.pdf

Size

422.4 KB

Format

Unknown

Checksum (MD5)

5ab6007de99552e946c40302559739e3

Download all files submitted through automated deposit
art_3945210398864597633.zip (395.45 KB)
Author(s)
Farber, Miriam
•
Galashin, Pavel
Date Issued
February 2018
Publisher
Springer International Publishing
Version
Author's final manuscript
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 of sets that are weakly separated from two fixed sets I and J. We show that all maximal by inclusion weakly separated collections W ⊂A I, J are also maximal by size, provided that I and J are sufficiently “generic”. We also give a simple formula for the cardinality of Win terms of I and J. 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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/131564.2
DOI of Published Version
https://doi.org/10.1007/s00029-018-0394-2
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.