arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.2382math.CO
收藏

Curling数猜想

The Curling Number Conjecture

Benjamin Chaffin, N. J. A. Sloane

摘要:

给定一个有限的非空整数序列S,通过对相邻项进行分组,总是可以将其写成S = X Y^k,可能有很多种方式,其中X和Y是序列,Y是非空的。选择最大化k值的版本:这个k是S的卷曲数。卷曲数猜想是,如果从任何初始序列S开始,并通过重复附加当前序列的卷曲数来扩展它,则序列最终将达到1。该猜想仍然是开放的,但我们将报告的情况下,当S只由2和3的一些数值结果和插图。

英文摘要:

Given a finite nonempty sequence of integers S, by grouping adjacent terms it is always possible to write it, possibly in many ways, as S = X Y^k, where X and Y are sequences and Y is nonempty. Choose the version which maximizes the value of k: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial sequence S, and extends it by repeatedly appending the curling number of the current sequence, the sequence will eventually reach 1. The conjecture remains open, but we will report on some numerical results and conjectures in the case when S consists of only 2's and 3's.

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

↑