Search arXivSearch

arXiv · 2506.19443

From dual canonical bases to positroidal subdivisions

Abstract

The Grassmannian cluster algebra $\mathbb{C}[\text{Gr}(k, n)]$ admits a distinguished basis known as the dual canonical basis, whose elements correspond to rectangular semi-standard Young tableaux with $k$ rows and with entries in $[n]$. We establish that each such tableau induces a positroidal subdivision of the hypersimplex $Δ(k,n)$ via a map introduced by Speyer and Williams. For $\text{Gr}(2,n)$, we prove that non-frozen prime tableaux correspond precisely to the coarsest positroidal subdivisions of $Δ(2,n)$. Furthermore, we present computational evidence extending these results to $k>2$. In the process, we formulate a conjectural formula for the number of split positroidal subdivisions of $Δ(k,n)$ for any $k \ge 2$ and explore the deep connections between the polyhedral combinatorics of $Δ(k,n)$ and the dual canonical basis of $\mathbb{C}[\text{Gr}(k, n)]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian-Rong Li, Ayush Kumar Tewari. 2025-08-20. From dual canonical bases to positroidal subdivisions. https://arxiv.org/abs/2506.19443

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