arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.08558math.NTcs.SC
收藏

求整体域上的平方和

Solving sums of squares in global fields

Przemysław Koprowski

摘要:

将一个完全正的元素写成平方和的问题在数学中有着悠久的历史,可以追溯到Bachet和Lagrange。虽然对于某些特定的环(如整数或有理数上的多项式),有已知的方法可以将元素分解为平方和,但对于许多其他重要的环和域,这个问题仍然是广泛开放的。本文给出了一个将任意整体域(数域或整体函数域)的元素分解为最小长度平方和的显式算法。

英文摘要:

The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known methods for decomposing an element into a sum of squares, in general, for many other important rings and fields, the problem is still widely open. In this paper, we present an explicit algorithm for decomposing an element of an arbitrary global field (either a number field or a global function field) into a sum of squares of minimal length.

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

↑