Related papers: z-Classes and Rational Conjugacy Classes in Altern…

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…

The well-known Landau's theorem states that, for any positive integer $k$, there are finitely many isomorphism classes of finite groups with exactly $k$ (conjugacy) classes. We study variations of this theorem for $p$-regular classes as…

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…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

The main result of this paper shows that, over large enough fields of characteristic different from $2$, the alternating Hecke algebras are $\mathbb{Z}$-graded algebras that are isomorphic to fixed-point subalgebras of the quiver Hecke…

The trialitarian automorphisms considered in this paper are the outer automorphisms of order 3 of adjoint classical groups of type D_4 over arbitrary fields. A one-to-one correspondence is established between their conjugacy classes and…

We find an upper bound for the number of groups of order $n$ up to isomorphism in the variety $G = A_pA_qA_r$, where $p$, $q$ and $r$ are distinct primes. We also find a bound on the orders and on the number of conjugacy classes of…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Let $G$ be a finite group and let $p$ be a prime. In this paper, we study the structure of finite groups with a large number of $p$-regular conjugacy classes or, equivalently, a large number of irreducible $p$-modular representations. We…

Let $G$ be a finite group, and let $N(G)$ be the set of sizes of its conjugacy classes. We show that if a finite group $G$ has trivial center and $N(G)$ equals to $N(Alt_n)$ or $N(Sym_n)$ for $n\geq 23$, then $G$ has a composition factor…

Let G be a noncyclic group of order 4, and let K be the ring Z of rational integers, the localization of Z at the prime 2 and the ring of 2-adic integers, respectively. We describe, up to conjugacy, all of the indecomposable subgroups in…

For every odd integer $n \geq 3$, we prove that there exist infinitely many number fields of degree $n$ and associated Galois group $S_n$ whose class number is odd. To do so, we study the class groups of families of number fields of degree…

An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…

For a prime $p$, we say that a conjugacy class of a finite group $G$ is $p$-vanishing if every irreducible character of $G$ of degree divisible by $p$ takes value 0 on that conjugacy class. In this paper we completely classify 2-vanishing…

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…

We consider the capability of $p$ groups of class two and odd prime exponent. We use linear algebra and counting arguments to establish a number of new results. In particular, we settle the 4-generator case, and prove a sufficient condition…

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

A computation shows that there are 77 (up to scalar shifts) possible pairs of integer coefficient polynomials of degree five, having roots of unity as their roots, and satisfying the conditions of Beukers and Heckman [1], so that the…

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…