一种基于交织序列的周期性检测算法
Algorithm to Detect Periodicity by Interleaving Sequences
摘要:
我们定义了一个算法,它从一个序列的序列开始,并产生一个单一的序列,具有以下性质:如果至少有一个原始序列有一个周期性的尾部,那么输出序列有一个周期性的尾部,反之亦然。我们的目的是补充Dasaratha等人的结果,其中,实数输入产生可数序列族,具有当且仅当输入是三次无理数时至少一个序列最终是周期性的特性。在该结果的上下文中,该结果试图解决埃尔米特问题,该问题要求对可以通过周期性检测立方数的连分数进行某种推广。我们注意到在我们的结束语如何这个特殊的伎俩未能给一个令人满意的解决厄米的问题,但我们提出它无论如何,任何人可能感兴趣。
英文摘要:
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail, and conversely. Our purpose is to supplement a result by Dasaratha et al., in which a real number input results in a countable family of sequences, with the property that at least one is eventually periodic if and only if the input is a cubic irrational number. This result, in the context of that one, attempts to address Hermite's problem, which asks for some generalization of continued fractions that can detect cubic numbers via periodicity. We note in our ending remarks how this particular trick fails to give a satisfying resolution to Hermite's problem, but we present it anyway, for anyone whom it may interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。