Related papers: An algorithm for computing Schur indices of charac…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

A complex irreducible character of a finite group G is said to be p-constant, for some prime p dividing the order of G, if it takes constant value at the set of p-singular elements of G. In this paper we classify irreducible p-constant…

Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…

For an irreducible complex character \(\chi\) of a finite group \(G\), the \emph{codegree} of \(\chi\) is defined as the ratio \(|G : \ker(\chi)| / \chi(1)\), where \(\ker(\chi)\) represents the kernel of \(\chi\). In this paper, we provide…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

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…

This book describes some computational methods to deal with modular characters of finite groups. It is the theoretical background of the MOC system of the same authors. This system was, and is still used, to compute the modular character…

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

Let $G$ be a finite group and $V$ be a finite $G$--module. We present upper bounds for the cardinalities of certain subsets of $\Irr(GV)$, such as the set of those $\chi\in\Irr(GV)$ such that, for a fixed $v\in V$, the restriction of $\chi$…

We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$, where $cd(G)=\{\chi(1)| \chi \in Irr(G)\}$. We call such a group a GVZ-group with two character degrees. We…

We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.

The covering number of a non-linear character $\chi$ of a finite group $G$ is the least positive integer $k$ such that every irreducible character of $G$ occurs in $\chi^k$. We determine the covering numbers of irreducible characters of the…

We present a new sum rule for Clebsch-Gordan coefficients using generalized characters of irreducible representations of the rotation group. The identity is obtained from an integral involving Gegenbauer ultraspherical polynomials. A…

We establish a Murnaghan--Nakayama rule for the irreducible characters of the cyclotomic Hecke algebra $\mathscr H_{m,n}(q,u)$ on Shoji's standard elements. Combined with Shoji's determinacy result, our formula provides a direct…

We classify the irreducible unitary modules in category O for the rational Cherednik algebras of type G(r,1,n) and give explicit combinatorial formulas for their graded characters. More precisely, we produce a combinatorial algorithm…

We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…

This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…

We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…