Abstract
En vue d'applications au calcul des tables de caractères des algèbres de Hecke, on présente un algorithme permettant, à partir d'un élément quelconque σ ε Sn, de construire un élément de longueur maximale dans la classe de conjugaison de σ.We present an algorithm which allows us, starting from an arbitrary element σ ε Sn, to get an element with maximal length in the conjugacy class of a.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
