Related papers: An Algorithm for Constructing All Supercharacter T…

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 introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes. In the 1980's Thompson conjectured that the equality $N(G)=N(S)$, where $Z(G)=1$ and $S$ is simple, implies the isomorphism $G\simeq S$. In a series of papers of…

In this paper we study Cartan subalgebras in general and special linear algebras over a field of positive characteristic. We determined the conjugacy classes of Cartan subalgebras under the general linear groups, and count the explicit…

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…

We consider invariants of a finite group related to the number of random (independent, uniformly distributed) conjugacy classes which are required to generate it. These invariants are intuitively related to problems of Galois theory. We…

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…

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…

In this paper we give a bound to the number of conjugacy classes of maximal subgroups of any almost simple group whose socle is a classical group of Lie type. The bound is $2n^{5.2}+n\log_2\log_2 q$, where $n$ is the dimension of the…

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…

In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these…

A set of invariants for a finite group is described. These arise naturally from Frobenius' early work on the group determinant and provide an answer to a question of Brauer. Whereas it is well known that the ordinary character table of a…

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. infinite and of which all conjugacy classes except {1} are infinite) for groups which are defined by an extension of groups. We give characterizations…

It is a fun game to complete a partial character table of a finite group. We show that one can reconstruct a missing row or column from a given table. The proof relies on deep properties of fully ramified characters. Moreover, we extend a…

By studying lattices of normal subgroups, especially those of the socle and radical, an expression is obtained for the minimal number of conjugacy classes required to generate a group. This number is shown to be captured by the character…

A special type of conjugacy classes in symmetric groups is studied and used to answer a question about odd-degree irreducible characters