Project Details
Description
This project is going to establish the unitary algorithm for a nonlinear cover of a reductive Lie group. This is a generalization of the algorithm for linear reductive groups developed by Adams, van Leeuwen, Trapa and Vogan. The unitary algorithm is an algorithm which computes the signature of Hermitian forms on a representation, and to determine the unitarity of a representation. It will be very helpful for us to solve the unitary dual problem.
| Status | Active |
|---|---|
| Effective start/end date | 1/08/23 → 31/07/25 |
UN Sustainable Development Goals
In 2015, UN member states agreed to 17 global Sustainable Development Goals (SDGs) to end poverty, protect the planet and ensure prosperity for all. This project contributes towards the following SDG(s):
Keywords
- Lie groups
- nonlinear covering groups
- small representations
- unitary representations
- unitary algorithm
- Hermitian forms
- positive definite
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.