Polynomial Minimum Root Separation

Autor:	George E. Collins
Rok vydání:	2001
Předmět:	Polynomial Algebra and Number Theory 010102 general mathematics Separation (statistics) Root (chord) 010103 numerical & computational mathematics Square-free integer 01 natural sciences Upper and lower bounds Combinatorics Computational Mathematics Square root 0101 mathematics Mathematics
Zdroj:	Journal of Symbolic Computation. 32:467-473
ISSN:	0747-7171
DOI:	10.1006/jsco.2001.0481
Popis:	There is a well-known lower bound, due to Mignotte, for the minimum root separation of a squarefree integral polynomial, but no evidence for the sharpness of this bound. This paper provides massive computational evidence for a conjectured much larger bound, one that is approximately the square root of Mignotte’s bound.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac241d32eea03bf127883220ff2e4849 https://doi.org/10.1006/jsco.2001.0481 Zobrazit plný text záznamu Full Text from ScienceDirect