arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.09928math.GR
收藏

置换与线性群的不变生成

Invariable generation of permutation and linear groups

Gareth M. Tracey

摘要:

如果$\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$为每个$d$ -元组\emph{invariably generates}生成$G$,则组$G$的子集$\left\{x_{1},x_{2},\hdots,x_{d}\right\}$为$G$.证明了有限维完全可约线性群$n$总是由$\left\lfloor \frac{3n}{2}\right\rfloor$元生成。我们还证明了更严格的界限时,该领域的问题,以$2$或$3$。最后,我们证明了一个度为$n\geq 2$的可迁[分别本原]置换群[分别$n\geq 3$ ]可以始终由$O\left(\frac{n}{\sqrt{\log{n}}}\right)$生成[分别$O\left(\frac{\log{n}}{\sqrt{\log{\log{n}}}}\right)$ ]元素。

英文摘要:

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$. We prove that a finite completely reducible linear group of dimension $n$ can be invariably generated by $\left\lfloor \frac{3n}{2}\right\rfloor$ elements. We also prove tighter bounds when the field in question has order $2$ or $3$. Finally, we prove that a transitive [respectively primitive] permutation group of degree $n\geq 2$ [resp. $n\geq 3$] can be invariably generated by $O\left(\frac{n}{\sqrt{\log{n}}}\right)$ [resp. $O\left(\frac{\log{n}}{\sqrt{\log{\log{n}}}}\right)$] elements.

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

↑