二阶完整序列的正极小性

George Kenison, O. Klurman, Engel Lefaucheux, F. Luca, P. Moree, J. Ouaknine, Markus A. Whiteland, J. Worrell
{"title":"二阶完整序列的正极小性","authors":"George Kenison, O. Klurman, Engel Lefaucheux, F. Luca, P. Moree, J. Ouaknine, Markus A. Whiteland, J. Worrell","doi":"10.4230/LIPIcs.MFCS.2021.67","DOIUrl":null,"url":null,"abstract":"An infinite sequence $\\langle{u_n}\\rangle_{n\\in\\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be positive if each $u_n \\geq 0$, and minimal if, given any other linearly independent sequence $\\langle{v_n}\\rangle_{n \\in\\mathbb{N}}$ satisfying the same recurrence relation, the ratio $u_n/v_n$ converges to $0$. In this paper, we focus on holonomic sequences satisfying a second-order recurrence $g_3(n)u_n = g_2(n)u_{n-1} + g_1(n)u_{n-2}$, where each coefficient $g_3, g_2,g_1 \\in \\mathbb{Q}[n]$ is a polynomial of degree at most $1$. We establish two main results. First, we show that deciding positivity for such sequences reduces to deciding minimality. And second, we prove that deciding minimality is equivalent to determining whether certain numerical expressions (known as periods, exponential periods, and period-like integrals) are equal to zero. Periods and related expressions are classical objects of study in algebraic geometry and number theory, and several established conjectures (notably those of Kontsevich and Zagier) imply that they have a decidable equality problem, which in turn would entail decidability of Positivity and Minimality for a large class of second-order holonomic sequences.","PeriodicalId":369104,"journal":{"name":"International Symposium on Mathematical Foundations of Computer Science","volume":"288 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On Positivity and Minimality for Second-Order Holonomic Sequences\",\"authors\":\"George Kenison, O. Klurman, Engel Lefaucheux, F. Luca, P. Moree, J. Ouaknine, Markus A. Whiteland, J. Worrell\",\"doi\":\"10.4230/LIPIcs.MFCS.2021.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An infinite sequence $\\\\langle{u_n}\\\\rangle_{n\\\\in\\\\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be positive if each $u_n \\\\geq 0$, and minimal if, given any other linearly independent sequence $\\\\langle{v_n}\\\\rangle_{n \\\\in\\\\mathbb{N}}$ satisfying the same recurrence relation, the ratio $u_n/v_n$ converges to $0$. In this paper, we focus on holonomic sequences satisfying a second-order recurrence $g_3(n)u_n = g_2(n)u_{n-1} + g_1(n)u_{n-2}$, where each coefficient $g_3, g_2,g_1 \\\\in \\\\mathbb{Q}[n]$ is a polynomial of degree at most $1$. We establish two main results. First, we show that deciding positivity for such sequences reduces to deciding minimality. And second, we prove that deciding minimality is equivalent to determining whether certain numerical expressions (known as periods, exponential periods, and period-like integrals) are equal to zero. Periods and related expressions are classical objects of study in algebraic geometry and number theory, and several established conjectures (notably those of Kontsevich and Zagier) imply that they have a decidable equality problem, which in turn would entail decidability of Positivity and Minimality for a large class of second-order holonomic sequences.\",\"PeriodicalId\":369104,\"journal\":{\"name\":\"International Symposium on Mathematical Foundations of Computer Science\",\"volume\":\"288 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Mathematical Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.MFCS.2021.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Mathematical Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.MFCS.2021.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

无穷实数序列$\langle{u_n}\rangle_{n\in\mathbb{N}}$如果满足多项式系数的线性递归关系,则是完整的(也称为p -递归或p -有限)。如果给定满足相同递归关系的任何其他线性无关序列$\langle{v_n}\rangle_{n \in\mathbb{N}}$,比率$u_n/v_n$收敛于$0$,则称这样的序列为正的$u_n \geq 0$和最小的。在本文中,我们关注满足二阶递归$g_3(n)u_n = g_2(n)u_{n-1} + g_1(n)u_{n-2}$的完整序列,其中每个系数$g_3, g_2,g_1 \in \mathbb{Q}[n]$是最多$1$次的多项式。我们确定了两个主要结果。首先,我们证明了判定这类序列的正性可以简化为判定极小性。其次,我们证明了判定极小性等价于判定某些数值表达式(如周期、指数周期和类周期积分)是否为零。周期和相关表达式是代数几何和数论的经典研究对象,一些已建立的猜想(特别是Kontsevich和Zagier的猜想)暗示它们有一个可判定的等式问题,这反过来又会导致一大类二阶完整序列的正极小性的可判定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Positivity and Minimality for Second-Order Holonomic Sequences
An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be positive if each $u_n \geq 0$, and minimal if, given any other linearly independent sequence $\langle{v_n}\rangle_{n \in\mathbb{N}}$ satisfying the same recurrence relation, the ratio $u_n/v_n$ converges to $0$. In this paper, we focus on holonomic sequences satisfying a second-order recurrence $g_3(n)u_n = g_2(n)u_{n-1} + g_1(n)u_{n-2}$, where each coefficient $g_3, g_2,g_1 \in \mathbb{Q}[n]$ is a polynomial of degree at most $1$. We establish two main results. First, we show that deciding positivity for such sequences reduces to deciding minimality. And second, we prove that deciding minimality is equivalent to determining whether certain numerical expressions (known as periods, exponential periods, and period-like integrals) are equal to zero. Periods and related expressions are classical objects of study in algebraic geometry and number theory, and several established conjectures (notably those of Kontsevich and Zagier) imply that they have a decidable equality problem, which in turn would entail decidability of Positivity and Minimality for a large class of second-order holonomic sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信