具有天花板函数解的嵌套递归
Nested recursions with ceiling function solutions
摘要:
考虑由R(n)= \sum_{i=1}^k R(n-s_i- \sum_{j=1}^{p_i} R(n-a_ij))+ nu定义的嵌套非齐次递归R(n),其中c个初始条件R(1)= xi_1 > 0,R(2)=xi_2 > 0,.,R(c)=xi_c > 0,其中参数是满足k > 0,p_i > 0和a_ij > 0的整数。我们发展了一个算法来回答以下问题:对于任意的有理数r/q,是否存在k,p_i,s_i,a_ij和nu的任何一组值,使得天花板函数ceiling{rn/q}是R(n)在适当的初始条件下生成的唯一解?我们应用这个算法来探索那些作为R(n)的解出现的天花板函数。从这种经验研究中出现的模式使我们得到以下一般结果:形式为ceiling{n/q}$的每个ceiling函数是无穷多个这样的递归的解。此外,经验证据表明,相反的猜想是正确的:如果ceiling{rn/q}是由上述形式的任何递归R(n)生成的解,则r=1。我们还使用我们的天花板函数的方法来推导出第一个已知的递归R(n)和康威的递归的自然推广之间的连接。
英文摘要:
Consider a nested, non-homogeneous recursion R(n) defined by R(n) = \sum_{i=1}^k R(n-s_i-\sum_{j=1}^{p_i} R(n-a_ij)) + nu, with c initial conditions R(1) = xi_1 > 0,R(2)=xi_2 > 0, ..., R(c)=xi_c > 0, where the parameters are integers satisfying k > 0, p_i > 0 and a_ij > 0. We develop an algorithm to answer the following question: for an arbitrary rational number r/q, is there any set of values for k, p_i, s_i, a_ij and nu such that the ceiling function ceiling{rn/q} is the unique solution generated by R(n) with appropriate initial conditions? We apply this algorithm to explore those ceiling functions that appear as solutions to R(n). The pattern that emerges from this empirical investigation leads us to the following general result: every ceiling function of the form ceiling{n/q}$ is the solution of infinitely many such recursions. Further, the empirical evidence suggests that the converse conjecture is true: if ceiling{rn/q} is the solution generated by any recursion R(n) of the form above, then r=1. We also use our ceiling function methodology to derive the first known connection between the recursion R(n) and a natural generalization of Conway's recursion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。