线性递推的正性证书
Positivity certificates for linear recurrences
AI总结:
本文针对具有唯一单重主导特征值的Poincaré型线性递推,提出一种在泛型初始条件下判定解正性的算法,并通过显式计算锥体的压缩性构造归纳证明证书。
摘要:
我们考虑具有多项式系数且属于Poincaré类型、并具有唯一单重主导特征值的线性递推。我们给出一个算法,在初始条件满足精确定义的泛型条件时,证明或否定解的正性。对于正序列,该算法生成一个正性证书,它是一个用于归纳证明的数据结构。该归纳通过证明一个显式计算的锥体在递推迭代下被压缩来工作。
英文摘要:
We consider linear recurrences with polynomial coefficients of Poincaré type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a precisely defined genericity condition. For positive sequences, the algorithm produces a certificate of positivity that is a data-structure for a proof by induction. This induction works by showing that an explicitly computed cone is contracted by the iteration of the recurrence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。