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

具有高容量和低周长的子集

Integer Subsets with High Volume and Low Perimeter

Patrick Devlin

摘要:

我们考虑一个特定的变化的“等周问题”采用的子集的非负整数。更具体地说,我们探索了OEIS A186053中描述的序列P(n)。我们提供了P(n)的第一个精确公式,包括涉及辅助函数的多重递归关系,以及简洁而令人满意的表示,甚至是准显式公式。我们还讨论了一些复杂的分形对称的序列,以及计算P(n)的算法的发展。最后,我们提出了一些有待进一步研究的开放性问题。注意,这是一个更先进的,但更简洁的版本,以前的arXiv论文arXiv:1107.2954的名称为“集与高容量和低周长”。

英文摘要:

We consider a certain variation of the 'isoperimetric problem' adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for P(n) including multiple recursive relations involving auxiliary functions as well as concise and satisfying representations and even quasi-explicit formulas. We also discuss some of the intricate fractal-like symmetry of the sequence as well as the development of algorithms for computing P(n). We conclude with open questions for further research. Note this is a more developed, but more concise version of a previous arXiv paper arXiv:1107.2954 by the name "Sets with High Volume and Low Perimeter".

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

↑