查询词典 finite cyclic group

In section 4,we research the solvable groups of finite rank,and provethat the union set of all quasi-cyclic subgroups of G is a characteristic subgroup andthe Hirsch number hdoes not exceed n if G is a solvable group of rank n.Inparticular,for an arbitrary solvable torsion-free group G of rank n,we give theupper bound fof the derived length of G.

在第4节里，我们研究了有限秩的可解群，证明了这类群的所有拟循环子群构成它的一个特征子群，且对秩n的可解群G来说，其Hirsch数h≤n，另外，我们给出了秩n的无挠可解群的导出长度的一个上界。

This article proves that a finite cyclic group can be isomorphically represented by direct product of some cyclic groups.

摘要本文运用基础代数中有关循环群、直积、同构等理论，证明了一个循环群可以用另一组循环群的直积形式来同构表示。

This paper discusses the relation beween order classification and isomorphic classification , gives some important characteristic properties of a cyclic group with order n and a important property of a p-group with finite order, introduces two factorization method of direct product for commutative p-group with finite order, presents some new problems.

讨论了阶分类与同构分类的关系，给出了n阶循环群的几个重要的特征性质和有限p-群的一个重要性质，介绍了有限交换p-群直积分解的两种方法，提出了一些新的问题。

ECC system makes use of the finite group of elliptic curve on the finite field instead of finite cyclic group used in the discrete logarithm problem. The theory of ECC is being studied a lot and it is the focus of the cryptography and the industrial estate, especially the technique of the implementation of ECC.In this thesis, the meaning of the information technology is discussed firstly, then we analyze the classical cryptography algoritham. After that, the mathematics base of elliptic curve cryptosytems are introduced, especially the theory of the finite field. As for some algorithms, we also give out the program of reliazation.

随后，介绍了研究椭圆曲线密码系统所需要的数学理论基础，特别是有限域中的椭圆曲线理论，并对相关的方法给出相应的实例及其程序实现；论文第三章讨论给出了椭圆曲线密码体制的研究现状，综述了椭圆曲线与现有一些密码算法的结合，介绍了椭圆曲线的离散对数问题以及椭圆曲线面临的攻击，详细描述了椭圆曲线密码系统的实现细节及各个部分的实验数据。

We present linear codes over finite fields with Mannheim weight and prove that those codes can correct one error taken from a cyclic subgroup of the multiplicative group of finite fields, which provide an algebraic approach in coding modulation.

最后讨论了有限域上的Mannheim线性纠错码，证明了当错误取值于有限域乘群的一个循环子群时，面向多维信号的线性分组码可以纠单个错并为码调制提供了一种代数渐进方法。

In Chapter 3, by using the technique of finite dimensional approximation of Seiberg-Wittentheory, the equivariant K-theory and some other methods, we study the problem of topologicalrestriction when there are smooth groups acting on Spin 4-manifolds such as the alternatinggroup A_5, cyclic group Z_6 and symmetric group S_3 with actions of odd type, consequently weimprove Furutas 10/8 theorem under the condition of group actions.

第三章运用Seiberg-Witten理论的有限维逼近技巧和等变K-理论等工具，研究了Spin 4-流形X上分别存在光滑交错群A_5、循环群Z_6和奇型三阶对称群S_3作用时，X的拓扑限制问题，在群作用下改进了Furuta的10／8定理。

In this paper, new classes of linear block codes over finite fields of the algebraicinteger ring of quadratic number fields Qd~(1/2 modulo irreducible elements with norm p or p~2 are presented. These codes can correct one error which takes from the cyclic subgroup of the multiplicative group of the finite fields. The results presented in this paper extend the corresponding results of previous papers.

在处理适用于二维信号的线性分组码时，我们考虑类数为1的有理数域二次扩域Qd~(1/2的代数整数环，利用范数为p或p~2的不可约元构造有限域，给出剩余类域的一组完全陪集代表元系，从而构造出一类有限域上的线性分组码，当错误取值于有限域乘法群的一个循环子群时，所得到的适用于二维信号的线性分组码可以纠单个错，推广了文[14-16]的结果。

In chapter 1 ,on one hand ,we give some sufficient conditions for a finite group to be supersolvable and nilipotent by using the properties of π-supplemented subgroups;For example: Theorem 3 Let G be a group, 2 ∈π, if every subgroup of G of prime order is contained in SE, every cyclic subgroup of G of order 4 is π-supplemented in G, then G will be supersolvable.

在第一章中，一方面我们利用π-可补子群的性质给出了有限群为超可解群及幂零群的若干充分条件；例如：定理3设G是群，2∈π，如果G的每个素数阶子群包含在SE中，G的每个4阶循环子群在G中π-可补，则G为超可解群。

Graf, without question, is the greatest women's player in history.

格拉芙，现在，毫无疑问是女子网坛历史上最伟大的选手。

If not, you will have to look around at all your important data.

如果没有，您将需要检查所有的重要数据。