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

如何产生尽可能多的索莫斯一样的奇迹,你希望

How To Generate As Many Somos-Like Miracles as You Wish

Shalosh B. Ekhad, Doron Zeilberger

摘要:

雅可比说“人必须永远是个好人”。事实上,只有像迈克尔·索莫斯这样的天才才能用一个特定的非线性递归,比如a(n)=(a(n-1)a(n-3)+a(n-2)^2)/a(n-4),服从a(1)=1,a(2)=1,a(3)=1,a(4)=1,然后观察到,令人惊讶的是,令人惊讶的是,它们总是生成整数。然后需要其他天才来证明这一事实(以及更普遍的所谓劳伦特现象)。但让我们按照雅可比的建议,往回走。与其在五十米外射击目标,而且很有可能打不中,不如先射击,然后再瞄准靶心。那我们就一定会成为射击冠军。那么让我们取一个整数序列,它显然只由整数组成,让我们心爱的计算机找到序列本身满足的非线性递归,或者定义良好的递归。

英文摘要:

Jacobi said "man muss immer umkehren". And indeed it takes a genius like Michael Somos to take a specific non-linear recurrence, like a(n)=(a(n-1)a(n-3)+a(n-2)^2)/a(n-4), subject to a(1)=1, a(2)=1, a(3)=1, a(4)=1, and observe that surprise, surprise, they always generate integers. Then it takes other geniuses to actually prove this fact (and the more general so-called Laurent phenomenon). But let's follow Jacobi's advise and go backwards. Rather than try to shoot a target fifty meters away, and most probably miss it, let's shoot first, and then draw the bull'e eye. Then we are guaranteed to be champion target-shooters. So let's take a sequence of integers that manifestly and obviously only consists of integers, and ask our beloved computers to find non-linear recurrences satisfied by the sequence itself, or by well-defined subsequences.

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

↑