Polynomial minimum root separation

14Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Collins, G. E. (2001). Polynomial minimum root separation. Journal of Symbolic Computation, 32(5), 467–473. https://doi.org/10.1006/jsco.2001.0481

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free