Related papers: Symmetric groups are determined by their character…

The Lie algbera of a compact semisimple Lie group G is determined by the degrees of the irreducible representations of G. However, two different groups can have the same representation degrees.

The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…

The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

We classify the finite groups $G$ which satisfies the condition that every complex irreducible character,whose degree's square doesn't divide the index of its kernel in $G$, lies in the same Galois conjugacy class.

We show that almost every entry in the character table of $S_N$ is divisible by any fixed prime as $N\to\infty$. This proves a conjecture of Miller.

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…

If all of the entries of a large $S_n$ character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic…

The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with…

Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

In part 1, we review the structure theory of $\mathbb{F} S_n$, the group algebra of the symmetric group $S_n$ over a field of characteristic 0. We define the images $\psi(E^\lambda_{ij})$ of the matrix units $E^\lambda_{ij}$ ($1 \le i, j…

Let X be an irreducible, primitive complex character of the finite solvable group G, and let X* denote the complex conjugate character. If the degree X(1) is odd, then we show how to associate to X in a unique way, a conjugacy class of…

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…

Let $H$ be a finite quasisimple classical group, i.e. $H$ is perfect and $S:=H/Z(H)$ is a finite simple classical group. We prove in this paper that, excluding the cases when the simple group $S$ has a very exceptional Schur multiplier such…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

This paper shows that groups of order $64$ are uniquely determined up to isomorphism by their Tables of Marks. This then resolves a previously posed question about whether all groups of order less than $96$ are determined by their Tables of…