SearcharxivSearch

arXiv · 2007.02459

Decomposing Linear Representations of Finite Groups

Abstract

We develop a package using the computer algebra system GAP for computing the decomposition of a representation $ρ$ of a finite group $G$ over $\mathbb{C}$ into irreducibles, as well as the corresponding decomposition of the centraliser ring of $ρ(G)$. Currently, the only open-source programs for decomposing representations are for non-zero characteristic fields. While methods for characteristic zero are known, there are no open-source computer programs that implement these methods, nor are details on how to achieve good performance of such an implementation published. We aim to record such details and demonstrate an application of our program in reducing the size of semidefinite programs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaashif Hymabaccus, Dmitrii Pasechnik. 2020-07-08. Decomposing Linear Representations of Finite Groups. https://arxiv.org/abs/2007.02459

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR