Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Weak Separation, Pur ...
Conference paper

Weak Separation, Pure Domains and Cluster Distance

Miriam Farber (1), Pavel Galashin (1)
(1) Department of Mathematics [MIT]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6343
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
1122374
Graduate Research Fellowship Program
Indicators
496
Views
519
Downloads

Weak Separation, Pure Domains and Cluster Distance

Miriam Farber (1), Pavel Galashin (1)
(1) Department of Mathematics [MIT]
Abstract
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.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Cited by

Source: OpenCitations

  • Totally Nonnegative Critical Varieties

    International Mathematics Research Notices

    Authors : Pavel Galashin

    Journal reference : Volume 2024, 2023, pp. 3649-3689

    DOI : 10.1093/imrn/rnad084
  • Flip cycles in plabic graphs

    arXiv (Cornell University)

    Authors : Alexey Balitskiy ORCID, Julian Wellman

    Journal reference : Volume 26, 2020, pp.

    DOI : 10.1007/s00029-020-0544-1
  • Higher secondary polytopes and regular plabic graphs

    Advances in Mathematics

    Authors : Pavel Galashin, Alexander Postnikov, Lauren Williams ORCID

    Journal reference : Volume 407, 2022, pp. 108549

    DOI : 10.1016/j.aim.2022.108549
  • Purity and Separation for Oriented Matroids

    Memoirs of the American Mathematical Society

    Authors : Pavel Galashin, Alexander Postnikov

    Journal reference : Volume 289, 2023, pp.

    DOI : 10.1090/memo/1439
  • Positroid cluster structures from relabeled plabic graphs

    Algebraic Combinatorics

    Authors : Chris Fraser ORCID, Melissa Sherman-Bennett ORCID

    Journal reference : Volume 5, 2022, pp. 469-513

    DOI : 10.5802/alco.220
Preview
Loading PDF preview...