$S_n$围长的平凡下界
The trivial lower bound for the girth of $S_n$
摘要:
考虑由随机元素对$x,y$生成的$S_n$的凯莱图。从猜想上讲,这个图的围长是$Ω(n \log n)$,概率倾向于$1$为$n\to\infty$。我们证明它至少是$Ω(n^{1/3})$。
英文摘要:
Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $Ω(n \log n)$ with probability tending to $1$ as $n\to\infty$. We show that it is at least $Ω(n^{1/3})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。