arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.01002math.NT
收藏

多例外点数的多项式时间检验

A Polynomial Time Test to Detect Number with Many Exceptional Points

Ryan Carpenter, Charles L. Samuels

摘要:

对于每个代数数$α$和每个正实数$t$,$t$度量马勒测度$m_t(α)$产生一个极值问题,其解随$t$的值而变化.第二作者研究了解发生变化的点$t$,称之为{ \it例外点$α$ }。虽然每个代数数只有1000个例外点,但证明了对于每个$N \in \mathbb N$,存在一个至少有$N$例外点的数.在这篇文章中,我们描述了一个多项式时间算法,用于建立至少有$N$例外点的数的存在性。我们的工作构成了一个最知名的现有算法,需要指数时间的改进。我们应用我们的主要结果表明,存在至少$37$例外点,另一个改进以前的工作,只能达到$11$例外点的数字。

英文摘要:

For each algebraic number $α$ and each positive real number $t$, the $t$-metric Mahler measure $m_t(α)$ creates an extremal problem whose solution varies depending on the value of $t$. The second author studied the points $t$ at which the solution changes, called {\it exceptional points for $α$}. Although each algebraic number has only finitely many exceptional points, it is conjectured that, for every $N \in \mathbb N$, there exists a number having at least $N$ exceptional points. In this article, we describe a polynomial time algorithm for establishing the existence of numbers with at least $N$ exceptional points. Our work constitutes an improvement over the best known existing algorithm which requires exponential time. We apply our main result to show that there exist numbers with at least $37$ exceptional points, another improvement over previous work which was only able to reach $11$ exceptional points.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑