arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.19094math.COmath.NT
收藏

独立集与连分数

Independent Sets and Continued Fractions

Rutgers University(罗格斯大学);University of Southern California(南加州大学)

Swee Hong Chan, Steven Heilman, Greta Panova

AI总结:

本文研究了树的独立集数量是否无限的问题,证明了其增长指数为0.1966,并展示了连通平面图能表示所有正整数,同时发现图边数与独立集数量之间的相变现象。

摘要:

Linek在1989年提出的问题是:树的独立集数量是否避免无限多个正整数。本文证明了树的独立集数量集的下界增长指数为0.1966。进一步证明了连通平面图能表示的正整数集具有渐近密度一。最后,本文建立了一个相变:当图边数少于d|V|(d<1)时,独立集数量集密度为零;而根据Shkredov在连分数理论中关于Zaremba猜想的最新突破,存在常数D,使得边数不超过D|V|的图的独立集数量覆盖所有正整数。

英文摘要:

Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of $0.1966$. We further prove that the set of positive integers representable by connected planar graphs has asymptotic density one. Lastly, we establish a phase transition: the number of independent sets of graphs with fewer than $d|V|$ edges for any $d<1$ is contained in a set of density zero, whereas, following Shkredov's recent breakthrough on Zaremba's conjecture in continued fraction theory, there exists a constant $D$ such that the number of independent sets of graphs with at most $D|V|$ edges covers all positive integers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑