Abstract
In this paper we analyze some points regarding computations on algebraically closed fields.
We give an explicit formula for the computation of a polynomial whose roots are the sum (resp. the product) of the roots of two given polynomials. This formula is obtained considering a transformation sending a polynomial in the sequence of its Newton symmetric functions, and allows to obtain a better bound for the complexity of the computation of the above polynomial than the bound that can be obtained with the resultant formula used e.g. by Loos.
We show how to represent elements in the algebraic closure of a field of finite transcendency with a choice of algebraically independent complex numbers; we show how a careful choice can give a good estimate for the root separation of the polynomials involved, and this in turn may be used to bound the complexity of the operations in the corresponding representation of the algebraically closed field.
We give an algorithm for absolute factorization which generalizes, with a much simpler proof, an absolute irreducibility test of Kaltofen.
Research with the contribution of Ministero della Pubblica Istruzione
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Baker, “Transcendental Number Theory,” Cambridge University Press, 1975.
B. Buchberger, G. E. Collins, R. Loos, “Computer Algebra,” Springer Verlag, Wien-New York, 1982.
P. L. Cijsouw, “Trancendence Measures,” (Ph.D. Thesis), Academic Services, Vinkeveen, 1972.
C. Di Crescenzo, D. Duval, Computation on Curves, in “EUROSAM 84,” Lecture Notes in Computer Science 174, Springer Verlag, Berlin-Heidelberg-New York, 1984, pp. 100–108.
E. Kaltofen, A Fast Absolute Irreducibility Criterion, Journal of Symbolic Comp. 1 (1985),.
S. Lang, A Transcendence Measure for E-functions, Mathematika 9 (1962), 157–161.
R. Loos, Computing in Algebraic Extensions, in “Computer Algebra,” (BCL), pp. 173–187.
J. G. Macdonald, “Symmetric Functions and the Hall Polynomials,” Clarendon Press, Oxford, 1979.
M. Mignotte, Some Useful Bounds, in “Computer Algebra,” (BCL), pp. 259–262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dvornicich, R., Traverso, C. (1989). Newton symmetric functions and the arithmetic of algebraically closed fields. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_79
Download citation
DOI: https://doi.org/10.1007/3-540-51082-6_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51082-6
Online ISBN: 978-3-540-46150-0
eBook Packages: Springer Book Archive