Search arXivSearch

arXiv · 2508.02891

Plabic Tangles and Cluster Promotion Maps

Abstract

Inspired by the BCFW recurrence for tilings of the amplituhedron, we introduce the general framework of `plabic tangles' that utilizes plabic graphs to define rational maps between products of Grassmannians called `promotions'. The central conjecture of the paper is that promotion maps are quasi-cluster homomorphisms, which we prove for several classes of promotions. In order to define promotion maps, we utilize $m$-vector-relation configurations ($m$-VRCs) on plabic graphs. We relate $m$-VRCs to the degree (a.k.a `intersection number') of the amplituhedron map on positroid varieties and characterize all plabic trees with intersection number one and their VRCs. Finally, we show that promotion maps admit an operad structure and, supported by the class of `$4$-mass box' promotions, we point at new positivity properties for non-rational maps beyond cluster algebras. Promotion maps have important connections to the geometry and cluster structure of the amplituhedron and singularities of scattering amplitudes in planar $\mathcal{N}=4$ super Yang-Mills theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaim Even-Zohar, Matteo Parisi, Melissa Sherman-Bennett, Ran Tessler, Lauren Williams. 2026-02-22. Plabic Tangles and Cluster Promotion Maps. https://doi.org/10.1016/j.jalgebra.2026.01.027

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