Cluster algebras associated with open Richardson varieties: an algorithm to compute initial seeds
Etienne M\'enard

TL;DR
This paper introduces an algorithm to compute initial seeds for cluster structures on categories linked to coordinate rings of open Richardson varieties, enabling explicit seed determination as previously considered by Leclerc.
Contribution
The paper presents a novel algorithm for explicitly computing initial seeds in cluster structures related to open Richardson varieties.
Findings
Algorithm successfully computes initial seeds for the specified cluster structures.
Explicit seeds align with those previously considered by Leclerc.
Enhances understanding of cluster algebra structures in Richardson varieties.
Abstract
We present a new algorithm to compute initial seeds for cluster structures on categories associated with coordinate rings of open Richardson varieties. This allows us to explicitely determine seeds first considered in Leclerc's 2016 article.
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Advanced Topics in Algebra
