Newton symmetric functions and the arithmetic of algebraically closed fields

  • Roberto Dvornicich
  • Carlo Traverso
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 356)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ba.
    A. Baker, “Transcendental Number Theory,” Cambridge University Press, 1975.Google Scholar
  2. BCL.
    B. Buchberger, G. E. Collins, R. Loos, “Computer Algebra,” Springer Verlag, Wien-New York, 1982.Google Scholar
  3. Ci.
    P. L. Cijsouw, “Trancendence Measures,” (Ph.D. Thesis), Academic Services, Vinkeveen, 1972.Google Scholar
  4. DD.
    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.Google Scholar
  5. Ka.
    E. Kaltofen, A Fast Absolute Irreducibility Criterion, Journal of Symbolic Comp. 1 (1985),.Google Scholar
  6. La.
    S. Lang, A Transcendence Measure for E-functions, Mathematika 9 (1962), 157–161.Google Scholar
  7. Lo.
    R. Loos, Computing in Algebraic Extensions, in “Computer Algebra,” (BCL), pp. 173–187.Google Scholar
  8. Ma.
    J. G. Macdonald, “Symmetric Functions and the Hall Polynomials,” Clarendon Press, Oxford, 1979.Google Scholar
  9. Mi.
    M. Mignotte, Some Useful Bounds, in “Computer Algebra,” (BCL), pp. 259–262.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Roberto Dvornicich
    • 1
  • Carlo Traverso
    • 2
  1. 1.Dipartimento di MatematicaUniversità della CalabriaItaly
  2. 2.Dipartimento di MatematicaUniversità di PisaItaly

Personalised recommendations