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

阶与给定整数互质的置换

Permutations with orders coprime to a given integer

John Bamberg, S. P. Glasby, Scott Harper, Cheryl E. Praeger

摘要:

令$m$为正整数,$ρ(m,n)$为对称群${\rm Sym}(n)$的置换的比例,其阶与$m$互质。2002年,Pouyanne证明了$ρ(n,m)n^{1-\frac{ϕ(m)}{m}}\sim κ_m$,其中$κ_m$是$m$的复杂(无界)函数。本文证明了存在一个正的常数$C(m)$,使得对所有的$n \geqslant m$,有\[C(m) \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1} \leqslant ρ(n,m) \leqslant \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1}\],其中$ϕ$是欧拉函数.

英文摘要:

Let $m$ be a positive integer and let $ρ(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $ρ(n,m)n^{1-\frac{ϕ(m)}{m}}\sim κ_m$ where $κ_m$ is a complicated (unbounded) function of $m$. We show that there exists a positive constant $C(m)$ such that, for all $n \geqslant m$, \[C(m) \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1} \leqslant ρ(n,m) \leqslant \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1}\] where $ϕ$ is Euler's totient function.

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

↑