Related papers: On conjygacy classes in groups

A group is nested if the centers of the irreducible characters form a chain. In this paper, we will show that there is a set of subgroups associated with the conjugacy classes of group so that a group is nested if and only if these…

Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for determining whether or not two given elements f, g of G are conjugate, i.e. whether there exists h belonging to G with fh = hg. This paper is…

In 1954 B. H. Neumann discovered that if $G$ is a group in which all conjugacy classes have finite cardinality at most $m$, then the derived group $G'$ is finite of $m$-bounded order. In 2018 G. Dierings and P. Shumyatsky showed that if…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

For a finite abelian group $G,$ the Davenport Constant, denoted by $D(G)$, is defined to be the least positive integer $k$ such that every sequence of length at least $k$ has a non-trivial zero-sum subsequence. A long-standing conjecture is…

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

We introduce a new real valued invariant for finitely presented groups called residual deficiency. Its main property is the following. Let G be a finitely presented group. If the residual deficiency of G is greater than one, then G has a…

Landau's theorem on conjugacy classes asserts that there are only finitely many finite groups, up to isomorphism, with exactly $k$ conjugacy classes for any positive integer $k$. We show that, for any positive integers $n$ and $s$, there…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

In 1954 B. H. Neumann discovered that if G is a group in which all conjugacy classes are finite with bounded size, then the derived group G' is finite. Later (in 1957) Wiegold found an explicit bound for the order of G'. We study groups in…

In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…

In this paper we present two new results on the number of certain conjugacy classes of a finite group. For a finite group $G$, let $n(G)$ be the maximum of $k_{p}(G)$ taken over all primes $p$ where $k_{p}(G)$ denotes the number of…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Just infinite groups play a significant role in profinite group theory. For each $c \geq 0$, we consider more generally JNN$_c$F profinite (or, in places, discrete) groups that are Fitting-free; these are the groups $G$ such that every…

A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of the symmetric groups and thereby verify a…