$W$-graph versions of tensoring with the $\S_n$ defining representation
Jonah Blasiak

TL;DR
This paper develops $W$-graph versions of tensoring with the defining representation of the symmetric group, providing combinatorial approximations and conjectures related to Hecke algebra structures and canonical bases.
Contribution
It introduces two new $W$-graph tensoring constructions for $ ext{S}_n$, analyzes their properties, and explores their relation to canonical bases and algebraic approximations.
Findings
Approximate canonical basis preservation as $rrow 0$
Conjecture on weak multiplicity-free restriction of $ ext{H}$ to $ ext{H}_J$
Partial results on the map $ ext{H} sr_{ ext{H}_J} ext{H} o ext{H}$
Abstract
We further develop the theory of inducing -graphs worked out by Howlett and Yin in \cite{HY1}, \cite{HY2}, focusing on the case . Our main application is to give two -graph versions of tensoring with the defining representation , one being \H \tsr_{\H_J} - for \H, \H_J the Hecke algebras of and the other (\pH \tsr_{\H} -)_1, where is a subalgebra of the extended affine Hecke algebra and the subscript signifies taking the degree 1 part. We look at the corresponding -graph versions of the projection . This does not send canonical basis elements to canonical basis elements, but we show that it approximates doing so as the Hecke algebra parameter . We make this approximation combinatorially explicit by determining it on cells. Also of interest is a combinatorial conjecture stating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Computational Geometry and Mesh Generation
