置换、图、映射、乱序
Permute, Graph, Map, Derange
摘要：
我们研究可分解的组合标记结构的exp-log类，具体来说，两个例子的类型a=1和两个例子的类型a=1/2。我们的方法是确定现有理论与实验数据的匹配程度。例如，随机n-置换中最长循环的中值长度是（0.6065.）* n，而随机n-映射中最大分量的中值长度为（0.7864...）* n.突出未解决的问题，希望有一天其他人可以解决这些问题。
英文摘要：
We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For instance, the median length of the longest cycle in a random n-permutation is (0.6065...)*n, whereas the median length of the largest component in a random n-mapping is (0.7864...)*n. Unsolved problems are highlighted, in the hope that someone else might address these someday.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
