自然数的根树编码的统计性质
Statistical Properties of the Rooted-Tree Encoding of $\mathbb{N}$
AI总结:
本文研究了自然数通过根树编码生成的序列的统计性质,揭示其在熵、压缩和相关性方面的独特行为,表明其具有长程相关性。
摘要:
我们通过递归分解将自然数进行质数编码,迭代到指数,生成了一组平面根树,等价地表示为Dyck词。这形成了一种确定性文本,具有内部规则。对这一语料库的统计分析表明,字典和熵以亚线性方式增长,压缩显示非单调趋势,且排名-频率曲线呈现稳定的抛物线形式,偏离Zipf定律。使用均方位移进行的相关性分析揭示了相关行走从正常扩散到超扩散的转变。这些发现将树编码序列表征为具有长程相关性的统计结构文本,其根源在于其生成的算术法则,为后续的理论和可学习性提供了实证基础。
英文摘要:
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules. Statistical analysis of the corpus reveals that the dictionary and the entropy grow sublinearly, compression shows non-monotonic trend, and the rank-frequency curves assume a stable parabolic form deviating from Zipf's law. Correlation analysis using mean-squared displacement reveals a transition from normal diffusion to superdiffusion in the associated walk. These findings characterise the tree-encoded sequence as a statistically structured text with long-range correlations grounded in its generative arithmetic law, providing an empirical basis for subsequent theoretical and learnability
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。