Decomposing Monomial Representations of Solvable Groups
✍ Scribed by Markus Püschel
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 808 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
We present an efficient algorithm that decomposes a monomial representation of a solvable group G into its irreducible components. In contradistinction to other approaches, we also compute the decomposition matrix A in the form of a product of highly structured, sparse matrices. This factorization provides a fast algorithm for the multiplication with A. In the special case of a regular representation, we hence obtain a fast Fourier transform for G. Our algorithm is based on a constructive representation theory that we develop. The term "constructive" signifies that concrete matrix representations are considered and manipulated, rather than equivalence classes of representations as it is done in approaches that are based on characters. Thus, we present well-known theorems in a constructively refined form and derive new results on decomposition matrices of representations. Our decomposition algorithm has been implemented in the GAP share package AREP. One application of the algorithm is the automatic generation of fast algorithms for discrete linear signal transforms.
📜 SIMILAR VOLUMES
Using a parametrization for the universal covering \(c_{10}\) of any coadjoint orbit \(c\) of a solvable (connected and simply connected) Lie group \(G\), we prove that the Moyal product on \(\mathfrak{c}_{0}\) gives a realization of the unitary representations canonically associated to the orbit (
We study holomorphically induced representations r of Lie groups G=exp g from weak polarizations h at f ¥ g\*. When G is a connected and simply connected Lie group whose Lie algebra is a normal j-algebra, we obtain a sufficient condition for non-vanishing of r and the decomposition of r into irreduc