Related papers: Generalised Burnside and Dixon algorithms for irre…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
In the previous paper, we proposed a practical method of constructing explicitly representation groups $R(G)$ for finite groups $G$, and apply it to certain typical finite groups $G$ with Schur multiplier $M(G)$ containing prime number 3.…
Schur multiplier $M(G)$ of a finite group $G$ has been studied heavily. To proceed further to the study of projective (or spin) representations of $G$ and their characters (called spin characters), it is necessary to construct explicitly a…
A method to construct irreducible unitary representations of a hyperspecial compact subgroup of a reductive group over p-adic field with odd p is presented. Our method is based upon Cliffods theory and Weil representations over finite…
A parametrization of irreducible unitary representations associated with the regular adjoint orbits of a hyperspecial compact subgroup of a reductive group over a non-dyadic non-archimedean local filed is presented. The parametrization is…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
In this paper, we introduce the generalised Knutson Index and compute it for the special linear groups and projective special linear groups of degree two by computing the lowest common multiple of the degrees of their irreducible…
We consider irreducible representations of finite quandles over $\mathbb{C}$. For $Q$ a finite quandle whose inner automorphism group $Inn(Q)$ have trivial Schur multipliers, we prove that the irreducible representations of $Q$ can be…
Let $F$ be a local non-archimedian field of positive characteristic, $D$ be a skew-field with center $F$ and $ G=D^{\star}$ be the multiplicative group of $D$. The goal of this paper is to provide a canonical decomposition of any complex…
Using a general result of Lusztig, we find the decomposition into irreducibles of certain induced characters of the projective general linear group over a finite field of odd characteristic.
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
For any finite group $G$ and any prime $p$ one can ask which ordinary irreducible representations remain irreducible in characteristic $p$. We answer this question for $p=2$ when $G$ is a proper double cover of the symmetric group. Our…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
In this paper, we first show that the irreducible characters of a quotient table algebra modulo a normal closed subset can be viewed as the irreducible characters of the table algebra itself. Furthermore, we define the character products…
We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, nonreduced) projective scheme. For example, the algorithm yields the topological Euler characteristic…
It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…