• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • James Parkinson
  • Workshop on computation in Coxeter groups and Kac-Moody algebras
  • 2pm–3pm, Thursday 17th November, 2011
  • Carslaw 273
  • Plancherel Theorems for Coxeter groups and Hecke algebras: It is elementary that each trace functional on a finite dimensional semisimple complex algebra can be written as a linear combination of the irreducible characters of the algebra. Explicitly computing such a formula is called a Plancherel Theorem. In this talk we will: (1) Expand on what is meant by a Plancherel Theorem (for example, outside of the finite dimensional setting), and explain why we might care about them, (2) Sketch some well understood cases (finite dimensional Hecke algebras and affine Hecke algebras), and (3) Say what we would like to understand outside of these cases.

  • Bob Howlett
  • Workshop on computation in Coxeter groups and Kac-Moody algebras
  • 3pm–4pm, Thursday 17th November, 2011
  • Carslaw 273
The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.