什么时候可以判定一个P-有限序列是正的?
When can we decide that a P-finite sequence is positive?
摘要:
我们考虑了两个算法,可用于证明由多项式系数线性递归方程定义的序列(P-有限序列)的正性。这两种算法的共同点是,虽然它们在很多例子上都成功了,但不能保证它们会终止,而且它们实际上不会对每个输入都终止。对于某些限制类的P-有限递归方程的顺序高达三,我们提供了一个先验的标准,断言终止的算法。
英文摘要:
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed on a great many examples, there is no guarantee for them to terminate, and they do in fact not terminate for every input. For some restricted classes of P-finite recurrence equations of order up to three we provide a priori criteria that assert the termination of the algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。