Related papers: Counting conjugacy classes of subgroups in a finit…

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

For the finite groups GU(3), SU(3), GL(3), SL(3) over a finite field we solve the class product problem, i.e., we give a complete list of $m$-tuples of conjugacy classes whose product does not contain the identity matrix.

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

Given a group $G$ we write $h(G)$ to denote the maximum number of times that a field extension of $\mathbb{Q}$ appears as the field of values of a conjugacy class of a group. In this work, we prove that $|G|$ is bounded in terms of $h(G)$.…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

We prove that any permutation group of degree $n \geq 4$ has at most $5^{(n-1)/3}$ conjugacy classes.

In this paper, we discuss a group-theoretical generalization of the well-known Gauss formula involving the functionthat counts the number of automorphisms of a finite group. This gives several characterizations of finite cyclic groups.

In this paper a new equivalence relation $\approx$ to classify the fuzzy subgroups of finite groups is introduced and studied. This generalizes the equivalence relation $\sim$ defined on the lattice of fuzzy subgroups of a finite group that…

We prove that there are only finitely many conjugacy classes of arithmetic maximal hyperbolic reflection groups.

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

We provide structural criteria for some finite factorised groups $G = AB$ when the conjugacy class sizes in $G$ of certain $\pi$-elements in $A\cup B$ are either $\pi$-numbers or $\pi'$-numbers, for a set of primes $\pi$. In particular, we…

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

It has been proved recently by Moreto and Craven that the order of a finite group is bounded in terms of the largest multiplicity of its irreducible character degrees. A conjugacy class version of this result was proved for solvable groups…

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…