2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1992)
Pittsburgh, PA, USA
Oct. 24, 1992 to Oct. 27, 1992
J. Blomer , Inst. fur Inf., Fachbereich Math., Freie Univ. Berlin, Germany
The author presents a simple condition when nested radical expressions of depth two can be denested using real radicals or radicals of some bounded degree. He describes the structure of these denestings and determines an upper bound on the maximum size of a denesting. Also for depth two radicals he describes an algorithm that will find such a denesting whenever one exists. Unlike all previous denesting algorithms the algorithm does not use Galois theory. In particular, he avoids the construction of the minimal polynomial and splitting field of a nested radical expression. Thus he can obtain the first denesting algorithm whose run time is at most, and in general much less, than polynomial in description size of the minimal polynomial. The algorithm can be used to determine non-trivial denestings for expressions of depth larger than two.
run time, number theory, nested radical expressions, denestings
J. Blomer, "How to denest Ramanujan's nested radicals", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 447-456, 1992, doi:10.1109/SFCS.1992.267807