Related papers: Finding Supercharacter Theories on Character Table…

This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…

We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group $G$ contains only two distinct values not divisible by a given prime number $p>3$, then $O^{pp'pp'}(G)=1$. This is done by…

We consider problems concerning the largest degrees of irreducible characters of symmetric groups, and the multiplicities of character degrees of symmetric groups. Using evidence from computer experiments, we posit several new conjectures…

We show the details of certain computations that are used in the paper "Verification of the conjugacy classes and ordinary character table of the Monster".

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…

Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…

Let $G$ be a finite group of order divisible by a prime $p$. The number of $p$-regular and $p'$-regular conjugacy classes of $G$ is at least $2\sqrt{p-1}$. Also, the number of $p$-rational and $p'$-rational irreducible characters of $G$ is…

When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power…

We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…

We construct two supercharacter theories (in the sense of P. Diaconis and I.M. Isaacs) for the parabolic subgroups in orthogonal and symplectic groups. For each supercharacter theory, we obtain a supercharacter analog of the A.A.Kirillov…

Robinson showed that the character degrees are determined by knowing, for all $n$, the number of ways that the identity can be expressed as a product of $n$ commutators. Earlier, Strunkov showed that the existence of characters of…

Applying the embedding of $A_{n-1}$ in $B_n$, $C_n$ and $D_n$ we construct a new supercharacter theory for the Sylow subgroups in orthogonal and symplectic groups over a finite field. The constructed supercharacter appears to be a little…

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

We classify finite groups with a small average number of zeros in the character table.

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

We construct supercharacter theories for a collection of unipotent matrix groups and produce a Hopf monoid from the supercharacters. These supercharacter theories are coarser than those defined by Diaconis--Isaacs for algebra groups and…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

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 group, let $N$ be a normal subgroup of $G$ and let $\theta$ be an irreducible character of $N$. We count the real irreducible characters of $G$ lying over $\theta$