Search arXivSearch

arXiv · 2210.13302

Leclerc's conjecture on a cluster structure for type A Richardson varieties

Abstract

Leclerc constructed a conjectural cluster structure on Richardson varieties in simply laced types using cluster categories. We show that in type A, his conjectural cluster structure is in fact a cluster structure. We do this by comparing Leclerc's construction with another cluster structure on type A Richardson varieties due to Ingermanson. Ingermanson's construction uses the combinatorics of wiring diagrams and the Deodhar stratification. Though the two cluster structures are defined very differently, we show that the quivers coincide and clusters are related by the twist map for Richardson varieties, recently defined by Galashin--Lam.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Khrystyna Serhiyenko, Melissa Sherman-Bennett. 2022-10-24. Leclerc's conjecture on a cluster structure for type A Richardson varieties. https://arxiv.org/abs/2210.13302

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