Results 11 to 20 of about 36,197 (185)
Groups with boundedly Černikov conjugacy classes [PDF]
Advances in Group Theory and Applications, 2021 Summary: A relevant theorem of B. H. Neumann states that if a group \(G\) has boundedly finite conjugacy classes, then its commutator subgroup \(G'\) is finite. This result has been generalized in [\textit{E. Detomi} et al., Glasg. Math. J. 63, No. 1, 54--58 (2021; Zbl 1530.20084)], where it is proved in particular that if the orbits of a group \(G ...
M. De Falco +3 more
doaj +4 more sources
COPRIME CONJUGACY CLASS SIZES [PDF]
Asian-European Journal of Mathematics, 2009 We consider finite groups in which every triple of distinct conjugacy class sizes greater than one has a pair which is coprime. We prove such a group is soluble and has conjugate rank at most three.
Camina, A. R., Camina, R. D.
openaire +1 more source
From conjugacy classes in the Weyl group to semisimple conjugacy classes [PDF]
Pure and Applied Mathematics Quarterly, 2021 Suppose $G$ is a connected complex semisimple group and $W$ is its Weyl group. The lifting of an element of $W$ to $G$ is semisimple. This induces a well-defined map from the set of elliptic conjugacy classes of $W$ to the set of semisimple conjugacy classes of $G$. In this paper, we give a uniform algorithm to compute this map.
Adams, Jeffrey, He, Xuhua, Nie, Sian
openaire +2 more sources
Countably recognizable classes of groups with restricted conjugacy classes [PDF]
International Journal of Group Theory, 2018 A group class ${ X}$ is said to be countably recognizable if a group belongs to ${X}$ whenever all its countable subgroups lie in ${X}$. It is proved here that most of the relevant classes of groups defined by restrictions on the conjugacy classes are ...
Francesco de Giovanni, Marco Trombetti
doaj +1 more source
On products of conjugacy classes in general linear groups [PDF]
International Journal of Group Theory, 2022 Let $K$ be a field and $n\geq 3$. Let $E_n(K)\leq H\leq GL_n(K)$ be an intermediate group and $C$ a noncentral $H$-class. Define $m(C)$ as the minimal positive integer $m$ such that $\exists i_1,\ldots,i_m\in\{\pm 1\}$ such that the product $C^{i_1 ...
Raimund Preusser
doaj +1 more source
Mathieu moonshine and Siegel Modular Forms
Journal of High Energy Physics, 2021 A second-quantized version of Mathieu moonshine leads to product formulae for functions that are potentially genus-two Siegel Modular Forms analogous to the Igusa Cusp Form. The modularity of these functions do not follow in an obvious manner.
Suresh Govindarajan, Sutapa Samanta
doaj +1 more source
Groups with Černikov conjugacy classes [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1991 AbstractThe aim of this paper is to prove some embedding theorems for groups with Černikov conjugacy classes. Moreover a characterization of periodic central-by-Černikov groups is given.
DE GIOVANNI, FRANCESCO +2 more
openaire +3 more sources
Two moonshines for L2(11) but none for M12
Nuclear Physics B, 2019 In this paper, we revisit an earlier conjecture by one of us that related conjugacy classes of M12 to Jacobi forms of weight zero and index one. We construct Jacobi forms for all conjugacy classes of M12 that are consistent with constraints from group ...
Suresh Govindarajan, Sutapa Samanta
doaj +1 more source
Symmetric groups and conjugacy classes [PDF]
Journal of Group Theory, 2008 Let S_n be the symmetric group on n-letters. Fix n>5. Given any nontrivial $ , \in S_n$, we prove that the product $ ^{S_n} ^{S_n}$ of the conjugacy classes $ ^{S_n}$ and $ ^{S_n}$ is never a conjugacy class. Furthermore, if n is not even and $n$ is not a multiple of three, then $ ^{S_n} ^{S_n}$ is the union of at least three distinct ...
Adan-Bante, Edith, Verrill, Helena
openaire +3 more sources
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