A new algorithm for finding an l.c.r. set in certain two-sided cells.

DOI10.2140/PJM.2012.256.235MaRDI QIDQ433545zbMATHOpenAlexFDO

Authors Jian-yi Shi

Publication date 5 July 2012

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL http://msp.berkeley.edu/pjm/2012/256-1/p13.xhtml

zbMATH Keywords

algorithmsleft cellsaffine Weyl groupsalcove formstwo-sided cells

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Hecke algebras and their representations (20C08) Representation theory for linear algebraic groups (20G05)

Recommendations

• Left cells in affine Weyl groups
• Left Cells witha-Value 4 in the Affine Weyl Groups (i = 6, 7, 8)
• Cell decomposition in the affine weyl group w_A([Btilde]₄)
• Some left cells in the affine Weyl group \(\overset \sim E_6\)
• Left cells in the affine Weyl group \(W_ a({\widetilde D}_ 4)\)

Cited in

(2)

• Left cells in affine Weyl groups
• Left cells of the weighted Coxeter group \((\widetilde B_n,\widetilde\ell)\).

This page was built for publication: A new algorithm for finding an l.c.r. set in certain two-sided cells.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433545)