New lower bounds for the number of conjugacy classes in finite nilpotent groups [PDF]
P. Hall's classical equality for the number of conjugacy classes in $p$-groups yields $k(G) \ge (3/2) \log_2 |G|$ when $G$ is nilpotent. Using only Hall's theorem, this is the best one can do when $|G| = 2^n$. Using a result of G.J.
Edward A. Bertram
doaj +2 more sources
Finite groups have more conjugacy classes [PDF]
We prove that for every $\epsilon > 0$ there exists a $\delta > 0$ so that every group of order $n \geq 3$ has at least $\delta \log_{2} n/{(\log_{2} \log_{2} n)}^{3+\epsilon}$ conjugacy classes. This sharpens earlier results of Pyber and Keller. Bertram
Barbara Baumeister +2 more
openalex +4 more sources
Groups whose proper subgroups of infinite rank have polycyclic-by-finite conjugacy classes [PDF]
A group G is said to be a (PF)C-group or to have polycyclic-by-finite conjugacy classes, if G/C_{G}(x^{G}) is a polycyclic-by-finite group for all xin G. This is a generalization of the familiar property of being an FC-group.
Mounia Bouchelaghem, Nadir Trabelsi
doaj +1 more source
Conjugacy classes contained in normal subgroups: an overview [PDF]
We survey known results concerning how the conjugacy classes contained in a normal subgroup and their sizes exert an influence on the normal structure of a finite group.
Antonio Beltran +2 more
doaj +1 more source
On the Regular Power Graph on the Conjugacy Classes of Finite Groups [PDF]
The (undirected) power graph on the conjugacy classes PC(G) of a group G is a simple graph in which the vertices are the conjugacy classes of G and two distinct vertices C and C' are adjacent in PC(G) if one is a subset of a power of the other.
Sajjad Mahmood Robati
doaj +1 more source
The transitivity of primary conjugacy in regular ω-semigroups
The conjugacy relation plays an important role in group theory and the conjugacy relation of groups has been generalized to semigroups in various methods by several authors.
Liu Xin, Wang Shoufeng
doaj +1 more source
Extending Snow’s algorithm for computations in the finite Weyl groups
In 1990, D. Snow proposed an effective algorithm for computing the orbits of finite Weyl groups. Snow’s algorithm is designed for computation of weights, W-orbits, and elements of the Weyl group. An extension of Snow’s algorithm is proposed, which allows
Rafael Stekolshchik
doaj +1 more source
On two generation methods for the simple linear group $PSL(3,7)$ [PDF]
A finite group $G$ is said to be \textit{$(l,m, n)$-generated}, if it is a quotient group of the triangle group $T(l,m, n) = \left.$ In [J. Moori, $(p, q, r)$-generations for the Janko groups $J_{1}$ and $J_{2}$, Nova J.
Thekiso Seretlo
doaj +1 more source
The one-prime power hypothesis for conjugacy classes restricted to normal subgroups and quotient groups [PDF]
We say that a group $G$ satisfies the one-prime power hypothesis for conjugacy classes if the greatest common divisor for all pairs of distinct conjugacy class sizes are prime powers.
Julian Brough
doaj +1 more source
Finite non-nilpotent groups with few non-normal non-cyclic subgroups [PDF]
For a finite group $G$, let $nu_{nc}(G)$ denote the number of conjugacy classes of non-normal non-cyclic subgroups of $G$. We characterize the finite non-nilpotent groups whose all non-normal non-cyclic subgroups are conjugate.
Hamid Mousavi, Zahra Rezazadeh
doaj +1 more source

