登入選單

返回Google圖書搜尋

The Minimum Root Separation of a Polynomial

Stanford University. Computer Science DepartmentGeorge E. CollinsEllis Horowitz

出版	Defense Technical Information Center, 1973
URL	http://books.google.com.hk/books?id=5K6gNwAACAAJ&hl=&source=gbs_api

註釋

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. (Author).