finite group 中文意思是什麼
finite group
解釋
有限群-
It is well known that the normalizers of sylow subgroups of a finite group play a crucial role in the investigation of finite groups
眾所周知,有限群的西洛子群的正規化子在對有限群g的研究中起著極其重要的作用。 -
Theorem 2. 4 let g be a non - abelian inner - finite group, each non - trivial proper subgroup of g is prime order cyclic group if and only if g is a simple group ; each proper subgroup of g is nilpotent ; and each non - trivial subgroup of g is self - normalizer
4設g是非阿貝爾的內有限群,則g的每個非平凡真子群都是素數階循環群的充分必要條件是g是單群, g的每個真子群冪零且g的每個非平凡的真子群自正規化定理2 -
Sufficient and necessary conditions for solvable finite group
關于有限群可解的充要條件 -
Sufficient and necessary conditions for a finite group to be solvable
有限群可解的若干充分必要條件 -
Weakly c - normal subgroup of finite group and solvability
正規子群與有限群的可解性 -
The influence of fitting subgroup on structureof a finite group
子群對群結構的影響 -
For a maximal subgroup m of a finite group g the normal index of m is the order of a chief factor h / k where h is minimal in the set of supplements of m in g. in this paper we can obtain some results about solvability and supersolvability by using the normal indexes of maximal subgroups of finite groups
有限群g的極大子群m的正規指數是指g的主因子h k的階,其中h為m在g中的極小正規補。本文利用正規指數的概念,獲得有限群可解,超可解的若干結果。 -
The fluence of weakly quasinormal subgroups on the structure of finite group
弱擬正規子群對有限群結構的影響 -
By using the properties of - hypercenter and - homogeneous, some sufficient and necessary conditions for a finite group to be - nilpotent are obtained. and some well - known theorems are generalized
摘要利用-超中心和-齊次性的性質,對-冪零群作了較詳盡的研究,得到了有限群為-冪零群的幾個充要條件,推廣了一些著名的定理。 -
In 1, we give main definitions and basic results that are needed in the paper. in 2, we determine the structures of some groups by using s - normality of sylow subgroups and the maximal subgroups of sylow subgroups. there are the main theorems that 1 ) let g be a finite group and p be a sylow p - subgroup of g where p is a prime divisor of | g |
我們在1中將給出本文所需的主要概念和基本結果,在2中討論sylow子群、 sylow子群的極大子群的s -正規性對群的結構的影響,主要結果是1 )設g為有限群, p為| g |的素因子, p為g的sylowp -子群。 -
Graph theory, finite group acting on sets, orbit and equivalent relation are used to discuss the layout structure of networks for heat exchange, and a feasible optimization algorithm is given
應用圖論、有限群對集合的作用、軌道與等價關系等刻劃了換熱網路布局結構,並給出了可行的優化演算法。 -
The finite group that the order of maximal nilpotence subgroups are prime power
極大冪零子群的階為素數冪的有限群 -
An algorithm for grobner basis for an ideal of a polynomial ring over a group algebra of a finite group over a field is given
?給出了準確計算域上有限群的群代數上的多項式環的理想的gr ( ? ) bner基的演算法。 -
Algorithms for the minimal polynomial and the inverse of a given block symmetric circulant matrix over a group algebra of a finite group over a field are presented. and a method of determining singularity of this block symmetric circulant matrix is given
?給出了求域上有限群的群代數上的塊循環矩陣的極小多項式的演算法,西安電子科技大學博士學位論文:多項式代數及其應用奇異性判別法及其逆矩陣的求法 -
The definition of a mixed block matrix is given, and an algorithm for the inverse of a given mixed block matrix over a group algebra of a finite group over a field is presented, and a method of determining singularity of this mixed block matrix is given
?給出了域上有限群的群代數上的塊對稱循環矩陣的奇異性判別法及其逆矩陣求法. ,定義了域上有限群的群代數上的混合塊矩陣,並給出了它的可逆性的判別法及其逆矩陣的求法 -
Then g is solvable if and only if there exists a solvable s - normal maximal subgroup m of g ; 3 ) let g be a finite group and mo = 1 where m is a maximal subgroup of g. then g is solvable if and only if m is a supersolvable s - normal subgroup of g and | g : m | = r where r is a prime
則g可解當且張新建:關于有限群的s一止規子群僅當g有一個可解s一正規極大子群m ; 3 )設g為有限群, m為g的極大子群且mg = l 。則g可解當且僅當m為g的超可解s一正規子群且} g : m = r其中r為素數。 -
For a given finite connected graph f, a group h of automorphisms of f and a finite group a = z, du, kawk and xu ( see [ 6 ] ) get some new matrix - theoretical characterizations to classify all the connected regular coverings of f having a as its covering transformation group, on which each automorphism in h can be lifted
設為有限連通圖, h為它的自同構群的一個子群, a為給定一個初等交換p -群。杜少飛, kawk和徐明曜用矩陣的方法將的正則連通覆蓋圖進行了分類,其中以a作其為覆蓋變換群,並且h可提升。 -
In the dissertation, a " fast shamir algorithm represented by five - element joint sparse form " is presented. and it is demonstrated that comparing with other similar algorithms, the total numbers of the computation of our algorithm can be saved about 10 %, in the case of 192bit key. ( 5 ) in the implementation of elliptic curve cryptosystem, one of the key steps is to design and implement the base - point choice algorithm of elliptic curve finite group
已經證明,用本文提出的「五元聯合稀疏形式表示的shamir演算法」計算標量乘法對,在192bit的密碼體制中,其計算量比同類演算法平均減少了10兒( 5 )實現橢圓曲線密碼體制還有一個關鍵的步驟,就是橢圓曲線有限群基點選取演算法的設計與實現。 -
The realionships between the subgroups of a finite group g and the group g itself have been extensively studied in the literature
西洛群的正規化子有素數冪指數的有限群的冪零長度的界有限群g的子群和群g本身的關系已經被廣泛的研究。 -
C - normal subgroup of finite group and solvability
正規子群與可解性
分享友人