Search arXivSearch

arXiv · 2307.13369

Quasi-coincidence of cluster structures on positroid varieties

Abstract

By work of a number of authors, beginning with Scott and culminating with Galashin and Lam, the coordinate rings of positroid varieties in the Grassmannian carry cluster algebra structures. In fact, they typically carry many such structures, the two best understood being the source-labelled and target-labelled structures, referring to how the initial cluster is computed from a Postnikov diagram or plabic graph. In this article, we show that these two cluster algebra structures quasi-coincide, meaning in particular that a cluster variable in one structure may be expressed in the other structure as the product of a cluster variable and a Laurent monomial in the frozen variables. This resolves a conjecture attributed to Muller and Speyer from 2017. The proof depends critically on categorification: of the relevant cluster algebra structures by the author, of perfect matchings and twists by the author with Çanakçı and King, and of quasi-equivalences of cluster algebras by Fraser and Keller. By similar techniques, we also show that Muller and Speyer's left twist map is a quasi-cluster equivalence from the target-labelled structure to the source-labelled structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew Pressland. 2025-12-04. Quasi-coincidence of cluster structures on positroid varieties. https://doi.org/10.4171/jems%2F1736

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO