Minimal and random generation of permutation and matrix groups
Minimal and random generation of permutation and matrix groups
复制标题
排列和矩阵群的最小随机生成
DOI:
10.1016/j.jalgebra.2013.03.035
复制
发表时间:
2013
影响因子:
0.9
通讯作者:
Holt D
中科院分区:
文献类型:
--
作者:
Holt D
We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases. The bounds are linear in the degree of the permutation or matrix group in general, and logarithmic when the group is primitive. They can be combined with results of Lubotzky to produce explicit bounds on the number of random elements required to generate these groups with a specified probability. These results have important applications to computational group theory. Our proofs are inductive and largely theoretical, but we use computer calculations to establish the bounds in a number of specific small cases.
登录
查看更多内容
影响因子:
0.9
作者:
P. Cameron;R. Solomon;A. Turull
通讯作者:
A. Turull
影响因子:
0.9
作者:
A. Lucchini;F. Menegazzo;M. Morigi
通讯作者:
M. Morigi
DOI:
10.1090/s0002-9939-1991-1047004-0
发表时间:
1991
期刊:
Irish Mathematical Society Bulletin
影响因子:
--
作者:
Author L. G. Kovács;Geoffrey R. Robinson;L. Kovács;Geoffrey R. Robinson;J. Wong
通讯作者:
J. Wong
影响因子:
0.7
作者:
J. Wiegold
通讯作者:
J. Wiegold
DOI:
--
发表时间:
2002
期刊:
影响因子:
--
作者:
G. Hiss;G. Malle
通讯作者:
G. Malle