This paper studies problem of the average length of conjugacy classes of finite groups.
摘要本文研究有限群元素共轭类的平均长度问题。
This paper studies problem of the average length of conjugacy classes of finite groups.
本文研究有限群元素共轭类的平均长度问题。
The security of a braid public key cryptosystem can't depend only on the hardness of conjugacy problems.
辫子群上公钥密码系统的安全性不能仅仅依靠共轭问题的难解性。
In Chapter 3, we investigate how the number of conjugacy classes outside a normal subgroup of a finite group influences its structure.
第三章主要研究有限群的正规子群外的共轭类的个数对群结构的影响。
In this paper, we give a conjugacy-class-length characterization of finite minimal non-abelian groups and establish some related results.
文中，我们给出了有限极小非abel群的一个共轭类长——刻画并建立某些相关的结果。
Improved conjugacy was observed in the more severe INOs, and may be due to adaptive mechanisms, such as recruitment of vergence to aid gaze shifts.
较严重的INO患者中观察到共轭性有所好转，可能是适应性反应的结果，例如对聚散度的补充作用以助注视漂移。
In Chapter 2, we investigate how the number of conjugacy classes of elements outside the center with the same order of a finite group influences its structure.
第二章主要研究有限群的中心外的同阶元的共轭类个数对群结构的影响。
The conjugacy of virtual elements on projective plane was deeply discussed in this paper, and a few conclusions on the conjugacy of virtual elements were arrived at.
深入地探讨了射影平面上虚元素的共轭性，得到了有关虚元素共轭性的几个结论。
The braid groups have many hard problems that can be utilized to design cryptographic primitives, for example, the word problem, conjugacy problem, and root problem.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
We can get the size of same order elements if we put some different conjugacy classes with the same order elements together, then we will get order equation of a finite group.
如果先把互不共轭的同阶元的共轭类长合并得到同阶类长，再把同阶类长相加就得到了阶方程。
In this paper, some properties of automorphisms of classical Lie algebras was given first and then a classification of conjugacy automorphisms using only the matrix theory was presented.
首先给出了典型李代数自同构的一些性质，接着用矩阵的形式具体给出典型李代数自同构共轭的充要条件，并计算了任意阶自同构的不动点集。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
应用推荐