Search arXivSearch

arXiv · 2507.15211

Twists, Higher Dimer Covers, and Web Duality for Grassmannian Cluster Algebras

Abstract

We study a twisted version of Fraser, Lam, and Le's higher boundary measurement map, using face weights instead of edge weights, thereby providing Laurent polynomial expansions, in Plücker coordinates, for twisted web immanants for Grassmannians. In some small cases, Fraser, Lam, and Le observe a phenomenon they call "web duality'', where web immanants coincide with web invariants, and they conjecture that this duality corresponds to transposing the standard Young tableaux that index basis webs. We show that this duality continues to hold for a large set of $\text{SL}_3$ and $\text{SL}_4$ webs. Combining this with our twisted higher boundary measurement map, we recover and extend formulas of Elkin-Musiker-Wright for twists of certain cluster variables. We also provide evidence supporting conjectures of Fomin-Pylyavskyy as well as one by Cheung-Dechant-He-Heyes-Hirst-Li concerning classification of cluster variables of low Plücker degree in $\mathbb{C}[\text{Gr}(3,n)]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Esther Banaian, Elise Catania, Christian Gaetz, Miranda Moore, Gregg Musiker, Kayla Wright. 2026-02-07. Twists, Higher Dimer Covers, and Web Duality for Grassmannian Cluster Algebras. https://doi.org/10.1016/j.jalgebra.2026.03.019

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