随机排列的顺序的瑞尼熵
The Rényi entropy of the order of a random permutation
AI总结:
研究随机排列顺序的分布,通过瑞尼熵分析其渐进行为,揭示了瑞尼q熵与n的算术性质的紧密联系,特别是q=∞和q=2时的概率特性。
摘要:
我们通过瑞尼熵的视角研究随机排列的顺序分布。特别是,我们获得了瑞尼q熵在全范围1≤q≤∞内的渐近行为。对于q>1,我们的结果是定量最优的,揭示了瑞尼q熵的渐进行为与n的算术性质之间的紧密联系。特别关注q=∞和q=2的情况,分别对应于达到特定顺序的最大概率和两个独立随机排列具有相同顺序的概率。在前者情况下,我们证明该概率渐近于1/n,并进一步刻画了足够大的n时的最优解。在后者情况下,我们确定了概率作为n函数的最小和最大顺序,形式分别为c/n²和log*n/n²。我们的结果基本上回答了Acan、Burnette、Eberhard、Schmutz和Thomas提出的一系列问题,其中一些问题可以追溯到Erdős和Turán在1960年代的工作。
英文摘要:
We study the distribution of the order of a random permutation of $[n]$ through the lens of Rényi entropy. In particular, we obtain an asymptotic for the Rényi $q$-entropy of the order in the full range $1 \leq q \leq \infty$. For $q > 1$, our results are quantitatively optimal and reveal a tight connection between the asymptotic behaviour of the Rényi $q$-entropy and arithmetic properties of $n$. Of particular interest are the cases $q = \infty$ and $q = 2$, which correspond to the maximum probability of achieving a particular order and the probability that two independent random permutations have equal orders, respectively. In the former case, we show that the probability in question is asymptotic to $1/n$ and additionally characterise the maximiser for sufficiently large $n$. In the latter case, we determine a minimal and maximal order for the probability as a function of $n$, of respective forms $c/n^2$ and $\log^*n/n^2$. Our results provide an essentially complete answer to a set of questions raised by Acan, Burnette, Eberhard, Schmutz and Thomas, some of which go back to work of Erdős and Turán from the 1960s.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。