将单位正方形切割并排列块
Cutting a unit square and permuting blocks
AI总结:
本文研究了单位正方形切割排列的极限分布,推导了其最大部分的期望大小,并扩展了Erdős-Turán定律到排列子群。
摘要:
考虑一个随机排列$kn$个对象,该排列将$n$个不相交的大小为$k$的块进行排列,然后在每个块内排列元素。将其循环长度归一化为$kn$,得到一个随机的单位划分,我们推导了当$k,n$趋于无穷时该划分的极限定律。该极限可以通过一种简单的正方形切割过程来构造,这种过程推广了经典随机排列($k=1$)中的stick breaking方法。该正方形切割分布的最大部分的期望大小近似为0.40,与描述均匀随机排列中最长循环长度以及随机整数最大质因数的Golomb-Dickman常数约0.624形成对比。该最大部分的分布函数也被证明是某种乘法函数的均值。在此过程中,我们给出了Erdős-Turán定律向适当排列子群的首次扩展。
英文摘要:
Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law of this partition as $k,n \to \infty$. The limit may be constructed via a simple square cutting procedure that generalizes stick breaking in the classical case of random permutations ($k=1$). The expected size of the largest part of this square cutting distribution is approximated to be $0.40$, in contrast with the Golomb-Dickman constant around $0.624$ describing the longest cycle of a uniform random permutation as well as the largest prime factor of a random integer. The distribution function of this largest part is shown to also be the mean of a certain multiplicative function. Along the way we give the first extension of the Erdős-Turán law to a proper permutation subgroup.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。