Schur-Siegel-Smyth迹问题的新下界
New Lower Bounds for the Schur-Siegel-Smyth Trace Problem
AI总结:
本文提出寻找全正代数整数最小极限迹与次数之比下界的新方法,通过向Smyth线性规划方法添加约束减少变量,并用梯度下降算法数值求解,将最佳下界改进至1.80203。
摘要:
我们推导并实现了一种寻找全正代数整数的最小极限迹与次数之比下界的新方法,将先前已知的最佳下界改进至1.80203。我们的方法向Smyth的线性规划方法添加了新约束,以减少新感兴趣问题中所需的变量数量。这使得收敛更快,在我们的新界限族中最简单情形下恢复了Schur界,在次简单情形下恢复了Siegel界。我们还证明了新表述问题存在唯一最优解,并用多项式表示了该最优解。最后,我们使用梯度下降算法数值求解了该新问题,从而获得新下界1.80203。
英文摘要:
We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's linear programming method to decrease the number of variables required in the new problem of interest. This allows for faster convergence recovering Schur's bound in the simplest case and Siegel's bound in the second simplest case of our new family of bounds. We also prove the existence of a unique optimal solution to our newly phrased problem and express the optimal solution in terms of polynomials. Lastly, we solve this new problem numerically with a gradient descent algorithm to attain the new bound 1.80203.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。