连通性的渐近概率
Asymptotic probability for connectedness
AI总结:
本文研究了组合对象连通概率的渐近展开结构,证明了其系数为整数且可解释为导出组合类的计数序列,并将该结果应用于图、曲面及高维几何等多种模型。
摘要:
我们研究组合对象连通概率的渐近展开结构。我们证明这些渐近中出现的系数是整数,并且可以解释为其他导出组合类的计数序列。该一般性结果适用于快速增长的组合结构(我们称之为gargantuan),这些结构同时允许序列分解。该结果随后被应用于几种图模型、曲面模型(square-tiled surfaces、组合地图)以及高维几何模型(constellations、graph encoded manifolds)。相应的导出组合类是不可约(multi)tournaments、不可分解(multi)permutations和不可分解完美(multi)matchings。
英文摘要:
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of other derivative combinatorial classes. The general result applies to rapidly growing combinatorial structures, which we call gargantuan, that also admit a sequence decomposition. The result is then applied to several models of graphs, of surfaces (square-tiled surfaces, combinatorial maps), and to geometric models of higher dimension (constellations, graph encoded manifolds). The corresponding derivative combinatorial classes are irreducible (multi)tournaments, indecomposable (multi)permutations and indecomposable perfect (multi)matchings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。