Related papers: Codegrees of primitive characters of solvable grou…

In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.

In this note we use a result of Kantor to prove a conjecture of Degos. Specifically we prove the following: let $\mathbb{F}$ be a finite field of order $q$ and let $f, g\in\mathbb{F}[X]$ be distinct polynomials of degree $n$ such that $f$…

This paper reviews recent results and open problems on the conductor of finite group characters, highlighting their connections to one another and to broader topics in the representation theory of finite groups.

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

This work completes the classification of the imprimitive irreducible modules, over algebraically closed fields of characteristic 0, of the finite quasisimple groups.

We give new evidences to the fact that the structure of a solvable group can be controlled by irreducible monomial characters. In particular we inspect the role of monomial characters in Isaacs-Navarro-Wolf's conjecture and in Gluck's…

In this paper, we prove that all finite solvable groups satisfy the Isaacs-Seitz conjecture namely the derived lenght of a finite solvable group G is less than or equal to the number of distinct irreducible complex character degrees of G.

We describe gradings by finite abelian groups on the associative algebras of infinite matrices with finitely many nonzero entries, over an algebraically closed field of characteristic zero.

In this paper, a construction of Shoda pairs using character triples is given for a large class of monomial groups including abelian-by-supersolvable and subnormally monomial groups. The computation of primitive central idempotents and the…

We determine subnormalisers of semisimple elements of prime power order in finite quasi-simple groups of Lie type. For this, we determine the maximal overgroups of normalisers of Sylow tori. This is motivated by the recent character…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

In this paper we introduce and study the concept of normality degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be normal. Explicit formulas are obtained for some particular classes of…

If $G$ is a solvable group, we take $\Delta (G)$ to be the character degree graph for $G$ with primes as vertices. We prove that if $\Delta (G)$ is a square, then $G$ must be a direct product.

Recently, a new conjecture on the degrees of the irreducible Brauer characters of a finite group was presented by the second author. In this paper we propose a 'local' version of this conjecture for blocks B of finite groups, giving a lower…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…

In previous work Regev used part of the representation theory of Lie superalgebras to compute the values of a character of the symmetric group whose decomposition into irreducible constituents is described by semistandard…