BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-73-345
       ENTRY:: September 25, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The minimum root separation of a polynomial.
        TYPE:: Technical Report
      AUTHOR:: Collins, George E.
      AUTHOR:: Horowitz, Ellis
        DATE:: April 1973
       PAGES:: 15
    ABSTRACT:: The minimum root separation of a complex polynomial A is
               defined as the minimum of the distances between distinct
               roots of A. For polynomials with Gaussian integer
               coefficients and no multiple roots, three lower bounds are
               derived for the root separation. In each case the bound is a
               function of the degree, n, of A and the sum, d, of the
               absolute values of the coefficients of A. The notion of a
               semi-norm for a commutative ring is defined, and it is shown
               how any semi-norm can be extended to polynomial rings and
               matrix rings, obtaining a very general analogue of Hadamard's
               determinant theorem.
       NOTES:: [Adminitrivia V1/Prg/19950925]
         END:: STAN//CS-TR-73-345