Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    On the Distance Between the Roots of a Polynomial (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 327-332 
    Details
    ISSN: 1432-0622
    Keywords: Keywords: Roots of a polynomial ; Separating the roots ; Complex polynomials ; Integer polynomials.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract.  We prove a lower bound for the distance between two roots of a polynomial with complex coefficients. Such estimates are used to separate the roots of a polynomial.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01198012
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    On the distance between the roots of a polynomial (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 327-332 
    Details
    ISSN: 1432-0622
    Keywords: Roots of a polynomial ; Separating the roots ; Complex polynomials ; Integer polynomials
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract We prove a lower bound for the distance between two roots of a polynomial with complex coefficients. Such estimates are used to separate the roots of a polynomial.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01198012
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Lower Bounds for Catalan's Equation (1997)
    Springer
    The Ramanujan journal 1 (1997), S. 351-356 
    Details
    ISSN: 1572-9303
    Keywords: Catalan's equation ; exponential diophantine equations ; computational number theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper begins with a short historical survey on Catalan's equation, namely xp-yq=1, where p andq are prime numbers and x, y are non-zero rational integers. It is conjectured that the only solution is the trivial solution 32-23=1. We prove that there is no non-trivial solution with p orq smaller than 30000. The tools to reach such a result are presented. A crucial role is played by a recent estimate of linear forms in two logarithms obtained by Laurent, Mignotte and Nestrenko. The criteria used are also quite recent. We give information on the enormous amount of computation needed for the verification.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009701725510
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...