Clasped Webs, Trip Permutations, and Promotion on Tableaux
Presenter
December 10, 2025
Abstract
This is a joint project with Elise Catania and Jesse Kim.
Classical $U_q(\mathfrak{sl}_r)$-webs provide a diagrammatic framework for the invariant space of tensor products of copies of the vector representation. To model invariant spaces of tensor products involving arbitrary representations Kuperberg introduced \emph{clasped webs} for $\mathfrak{sl}_3$. His construction uses webs satisfying a \emph{minimal cut property} to form a basis of these clasped spaces. We give a new characterization of clasped basis webs in terms of \emph{trip permutations} $trip_\bullet$, a property we call \emph{self-trip-avoiding}. This viewpoint naturally generalizes to higher rank via the \emph{hourglass plabic graph framework} of Gaetz--Pechenik--Pfannerer--Striker--Swanson. A key observation in their framework is that basis webs for $\mathfrak{sl}_4$ can be indexed by rectangular standard Young tableaux $T$ satisfying $trip_\bullet(W) = prom_\bullet(T)$, where $prom_\bullet$ is the tuple of promotion permutations. We extend this by showing that, in arbitrary rank, SYT satisfying a \emph{self-prom-avoiding} property index a basis of the clasped space. Finally, for $r = 3$, we connect promotion on non-rectangular SYT of size $n$ to a notion of \emph{rotation} on clasped webs where one is taking $n$ copies of $V$ together with an additional clasp for $V^\mu$ for some weight $\mu$.