Abstract
The problem of simplification of nested radicals over arbitrary number fields was studied by many authors. The case of real radicals over real number fields is somewhat easier to study (at least, from theoretical point of view). In particular, an efficient (i.e., a polynomial-time) algorithm of simplification of at most doubly nested radicals is known. However, this algorithm does not guarantee complete simplification for the case of radicals with nesting depth more than two. In the paper, we give a detailed presentation of the theory that provides an algorithm which simplifies triply nested reals radicals over \(\mathbb {Q}\). Some examples of triply nested real radicals that cannot be simplified are also given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Becker, T., Weispfenning, V.: A Computational Approach to Commutative Algebra. Graduate Texts in Mathematics, vol. 141. Springer-Verlag, New York (1993). https://doi.org/10.1007/978-1-4612-0913-3
Besicovitch, A.S.: On the linear independence of fractional powers of integers. J. London Math. Soc. 15, 3–6 (1940)
Blömer, J.: Computing sums of radicals in polynomial time. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 670–677 (1991)
Blömer, J.: How to denest Ramanujan’s nested radicals. In: Proceedings of the 33nd Annual Symposium on Foundations of Computer Science, pp. 447–456 (1992)
Borevich, Z.I., Shafarevich, I.R.: Number Theory. Academic Press, London (1966)
Borodin, A., et al.: Decreasing the nesting depth of expressions involving square roots. J. Symb. Comput. 1, 169–188 (1985)
Davenport, J., Siret, Y., Tournier, E.: Calcul formel: Systèmes et algorithmes de manipulations algébriques. Masson, Paris (1987)
Landau, S.: Simplification of nested radicals. SIAM J. Comput. 21, 85–109 (1992)
Lang, S.: Algebra. Springer, New York (2002). https://doi.org/10.1007/978-1-4613-0041-0
Mordell, L.J.: On the linear independence of algebraic numbers. Pacific J. Math. 3, 625–630 (1953)
Osipov, N.N.: On the simplification of nested real radicals. Program. Comput. Softw. 23(3), 142–146 (1997)
Maplesoft. https://www.maplesoft.com
Acknowledgments
This work is supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation in the framework of the establishment and development of regional Centers for Mathematics Research and Education (Agreement No. 075-02-2020-1534/1).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Osipov, N.N., Kytmanov, A.A. (2021). Simplification of Nested Real Radicals Revisited. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2021. Lecture Notes in Computer Science(), vol 12865. Springer, Cham. https://doi.org/10.1007/978-3-030-85165-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-85165-1_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85164-4
Online ISBN: 978-3-030-85165-1
eBook Packages: Computer ScienceComputer Science (R0)