构造非零代数数指数格基的一个有效框架
An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
摘要:
计算代数数的指数格的基是计算数论中的一个基本问题,它在许多领域都有应用。解决该问题的著名算法\cite{ge1993algorithms,kauers2005algorithms}的主要代价是计算由给定代数数生成的扩展域的本原元。当扩展域的次数很大时,问题似乎难以由实现算法的工具来解决。本文引入了一类特殊的指数格基。基的一个重要特征是它可以归纳构造,这使得我们在计算基时可以对给定的代数数逐一处理。在此基础上,提出了一种构造指数格基的有效框架。通过先计算一个所谓的预基,然后求解一些线性丢番图方程,可以有效地构造基。给出了一种新的乘法独立性证明和一些代数数降阶技巧,以提高计算速度。新算法已在Mathematica上实现,并通过实例验证了其有效性。此外,该算法被应用于程序验证寻找线性循环的不变量。
英文摘要:
Computing a basis for the exponent lattice of algebraic numbers is a basic problem in the field of computational number theory with applications to many other areas. The main cost of a well-known algorithm \cite{ge1993algorithms,kauers2005algorithms} solving the problem is on computing the primitive element of the extended field generated by the given algebraic numbers. When the extended field is of large degree, the problem seems intractable by the tool implementing the algorithm. In this paper, a special kind of exponent lattice basis is introduced. An important feature of the basis is that it can be inductively constructed, which allows us to deal with the given algebraic numbers one by one when computing the basis. Based on this, an effective framework for constructing exponent lattice basis is proposed. Through computing a so-called pre-basis first and then solving some linear Diophantine equations, the basis can be efficiently constructed. A new certificate for multiplicative independence and some techniques for decreasing degrees of algebraic numbers are provided to speed up the computation. The new algorithm has been implemented with Mathematica and its effectiveness is verified by testing various examples. Moreover, the algorithm is applied to program verification for finding invariants of linear loops.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。