Abstract
The W-graph representations for symmetric groups Gn and their Hecke algebras have been studied by many authors, but the situation for a large n (for instance n ≥ 16) has not been completely solved. The aim of this note is to provide an algorithm of "inducing W-graphs" step by step from smaller n, to construct W-graphs for the left cells of the symmetric groups for bigger n.
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 callDisclaimer: 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.
