A canonical basis for Garsia-Procesi modules
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010).

Voir la notice de l'article provenant de la source Episciences

We identify a subalgebra $\widehat{\mathscr{H}}^+_n$ of the extended affine Hecke algebra $\widehat{\mathscr{H}}_n$ of type $A$. The subalgebra $\widehat{\mathscr{H}}^+_n$ is a u-analogue of the monoid algebra of $\mathcal{S}_n ⋉ℤ_≥0^n$ and inherits a canonical basis from that of $\widehat{\mathscr{H}}_n$. We show that its left cells are naturally labeled by tableaux filled with positive integer entries having distinct residues mod $n$, which we term positive affine tableaux (PAT). We then exhibit a cellular subquotient $\mathscr{R}_1^n$ of $\widehat{\mathscr{H}}^+_n$ that is a $u$-analogue of the ring of coinvariants $ℂ[y_1,\ldots,y_n]/(e_1, \ldots,e_n)$ with left cells labeled by PAT that are essentially standard Young tableaux with cocharge labels. Multiplying canonical basis elements by a certain element $*π ∈ \widehat{\mathscr{H}}^+_n$ corresponds to rotations of words, and on cells corresponds to cocyclage. We further show that $\mathscr{R}_1^n$ has cellular quotients $\mathscr{R}_λ$ that are $u$-analogues of the Garsia-Procesi modules $R_λ$ with left cells labeled by (a PAT version of) the $λ$ -catabolizable tableaux.
@article{DMTCS_2010_special_259_a53,
     author = {Blasiak, Jonah},
     title = {A canonical basis for {Garsia-Procesi} modules},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)},
     year = {2010},
     doi = {10.46298/dmtcs.2858},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2858/}
}
TY  - JOUR
AU  - Blasiak, Jonah
TI  - A canonical basis for Garsia-Procesi modules
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2858/
DO  - 10.46298/dmtcs.2858
LA  - en
ID  - DMTCS_2010_special_259_a53
ER  - 
%0 Journal Article
%A Blasiak, Jonah
%T A canonical basis for Garsia-Procesi modules
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2858/
%R 10.46298/dmtcs.2858
%G en
%F DMTCS_2010_special_259_a53
Blasiak, Jonah. A canonical basis for Garsia-Procesi modules. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010). doi : 10.46298/dmtcs.2858. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2858/

Cité par Sources :