arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1201.4686math.GRmath.CO
收藏

局部环上Chevalley群的直径

Diameters of Chevalley groups over local rings

Oren Dinai

摘要:

设G是秩为1的Chevalley群概型.我们证明了对于某个绝对常数d> 0和两个函数p_0 = p_0(l)和C = C(l,p),下列定理成立。设p> p_0是素数,G_n:= G(\Z/p ^n \Z)是n> 0的有限群族.则对于任何n> 0和生成G_n的任何子集S,我们有diam(G_n,S)<Cn ^d,即,G_n的任一元素都是来自S \cup S ^{-1}的Cn ^d个元素的乘积。特别地,对于某些C '= C'(1,p)和对于任何n> 0,我们有diam(G_n,S)<C 'log ^d(|G_n|)。我们的证明是初等的和有效的,因为常数d和函数p_0(l)和C(l,p)是显式计算的。此外,还存在一个计算群G_n中任意Cayley图中任意两点间最短路的有效算法。

英文摘要:

Let G be a Chevalley group scheme of rank l. We show that the following holds for some absolute constant d>0 and two functions p_0=p_0(l) and C=C(l,p). Let p>p_0 be a prime number and let G_n:=G(\Z/p^n\Z) be the family of finite groups for n>0. Then for any n>0 and any subset S which generates G_n we have diam(G_n,S)< C n^d, i.e., any element of G_n is a product of Cn^d elements from S\cup S^{-1}. In particular, for some C'=C'(l,p) and for any n>0 we have, diam(G_n,S)< C' log^d(|G_n|). Our proof is elementary and effective, in the sense that the constant d and the functions p_0(l) and C(l,p) are calculated explicitly. Moreover, there exists an efficient algorithm to compute a short path between any two vertices in any Cayley graph of the groups G_n.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑