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

We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

Let G be a finite p-group, where p is a prime number, and $\chi$ and $\psi$ be faithful complex irreducible characters of G. We study the relation between the number $\eta(\chi,\psi)$ of distinct irreducible constituents of the product…

For an irreducible character $\chi$ of a finite group $G$, its kernel is defined as $\text{ker }\chi=\{g\in G: \chi(g)=\chi(1)\}$. In this paper we characterize the finite groups of prime power order(for odd prime) in which kernels of all…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…

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…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

We give a new formula for the irreducible spin characters of the symmetric groups. This formula is analogous to Stanley's character formula for the usual (linear) characters of the symmetric groups.

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chi^c(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen, it was shown that $G$ cannot satisfy the condition…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

Let $G$ be a finite nilpotent group, $\chi$ and $\psi$ be irreducible complex characters of $G$ of prime degree. Assume that $\chi(1)=p$. Then either the product $\chi\psi$ is a multiple of an irreducible character or $\chi\psi$ is the…

The Schur Theorem says that if $G$ is a group whose center $Z(G)$ has finite index $n$, then the order of the derived group $G'$ is finite and bounded by a number depending only on $n$. In the present paper we show that if $G$ is a finite…

We classify the finite groups whose non-linear irreducible characters that are not conjugate under the natural Galois action have distinct degrees, therefore extending the results in Berkovich et al. [Proc. Amer. Math. Soc. {\bf 115}…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

A Pfaffian-type Murnaghan-Nakayama rule is derived for the Hecke-Clifford algebra $\mathcal{H}^c_n$ based on the Frobenius formula and vertex operators, and this leads to a combinatorial version via the tableaux realization of Schur's…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.