Results 1 to 10 of about 337 (153)
New lower bounds for the number of conjugacy classes in finite nilpotent groups [PDF]
International Journal of Group Theory, 2022 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
Improved covering results for conjugacy classes of symmetric groups via hypercontractivity
Forum of Mathematics, SigmaWe study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as normal sets. We show that for any $\epsilon>0$ , there exists $n_0$ such that if $n>n_0$ and A is a normal ...
Nathan Keller +2 more
doaj +4 more sources
Algorithms for twisted conjugacy classes of polycyclic-by-finite groups [PDF]
Topology and its Applications, 2021 We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that the Reidemeister coincidence number of these endomorphisms is finite.
Dekimpe, Karel, Tertooy, Sam
openaire +4 more sources
Conjugacy classes contained in normal subgroups: an overview [PDF]
International Journal of Group Theory, 2018 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
Twisted Conjugacy Classes for Polyfree Groups [PDF]
Communications in Algebra, 2013 11 ...
Fel'shtyn, Alexander +2 more
openaire +2 more sources
On the Regular Power Graph on the Conjugacy Classes of Finite Groups [PDF]
Mathematics Interdisciplinary Research, 2018 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
Open Mathematics, 2022 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
Conjugacy classes and characters for extensions of finite groups [PDF]
Chinese Annals of Mathematics, Series B, 2014 Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for tale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of $Q$. Furthermore, we prove a generalization of the orthogonality relation between characters of $G$.
Tang, Xiang, Tseng, Hsian-Hua
openaire +2 more sources
On two generation methods for the simple linear group $PSL(3,7)$ [PDF]
AUT Journal of Mathematics and Computing, 2023 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
Extending Snow’s algorithm for computations in the finite Weyl groups
Fixed Point Theory and Algorithms for Sciences and Engineering, 2023 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