Wallow
发表于 2025-3-23 11:03:49
On Right Conjugacy Closed Loops of Twice Prime Order,The right conjugacy closed loops of order 2., where . is an odd prime, are classified up to isomorphism.
BRAVE
发表于 2025-3-23 15:50:23
Compatible Actions and Non-abelian Tensor Products,For a pair of groups ., ., we study pairs of actions . on . and . on . such that these pairs are compatible. We prove that there are nilpotent group . and some group . such that for . the derivative group [., .] is equal to .. Also, we prove that if . act by inversion on an abelian group ., then the non-abelian tensor product . is isomorphic to ..
词根词缀法
发表于 2025-3-23 18:36:01
http://reply.papertrans.cn/39/3890/388954/388954_13.png
因无茶而冷淡
发表于 2025-3-24 00:04:25
Properties of Finite and Periodic Groups Determined by Their Element Orders (A Survey),Let . be a finite group. The function .assigns to . the set of orders of all elements of .. In this survey we shall describe results concerning information about G that can be derived by looking either at . or at the complete list of orders of elements of ..
苦恼
发表于 2025-3-24 04:44:46
http://reply.papertrans.cn/39/3890/388954/388954_15.png
Paraplegia
发表于 2025-3-24 08:11:50
The Future of Majorana Theory,During most of my mathematical career, I was directly involved in the construction of the Monster group ., proof of its uniqueness, and understanding of its origins and structure.
贫穷地活
发表于 2025-3-24 13:21:47
http://reply.papertrans.cn/39/3890/388954/388954_17.png
温和女人
发表于 2025-3-24 18:45:27
Camina Groups, Camina Pairs, and Generalizations,We survey the results regarding Camina groups and Camina pairs. We look at related topics such as Gagola characters, homogeneous induction, anti-central elements, the vanishing-off subgroup, and Camina triples. We also present several of the problems where these results have been applied.
extract
发表于 2025-3-24 19:51:22
http://reply.papertrans.cn/39/3890/388954/388954_19.png
NAIVE
发表于 2025-3-25 01:41:59
Character Tables and Sylow Subgroups Revisited,Suppose that . is a finite group. A classical and difficult problem is to determine how much the character table knows about the local structure of . and vice versa.