Algebraic Algorithms

该项目将研究符号计算的代数算法领域。具体来说，它将继续研究代数化简。本研究将对嵌套基的密集化和伽罗瓦群的计算进行研究。该项目还将研究多项式与整数之间的关系。在后一个领域，项目将调查如下问题：何时下限和上限从一个领域转换到另一个领域？这个项目也将尝试发展浮点多项式的符号计算理论。

The project will investigate the area of algebraic algorithms for symbolic computation. Specifically, it will continue work on algebraic simplication. This research will be on denesting nested radicals, and the computation for Galois groups. The project will also study the relationship between polynomials and integers. In the latter areas, the project will investigate such questions as: When do lower and upper bounds translate from one domain to the other? The project will also attempt to develop theory of symbolic computation for floating point polynomials.