You're right, thanks. David On Wed, Apr 29, 2015 at 6:11 AM, Jeroen Demeyer <[email protected]> wrote:
> There is no problem with reducible polynomials, only with non-squarefree > polynomials. The correct statement is: > > If your actual polynomial lies in the squarefree locus, it is possible to > increase precision enough so that a ball around it lies entirely within the > squarefree locus. But if the actual polynomial is not squarefree, any ball > will intersect the squarefree locus. > > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > Visit this group at http://groups.google.com/group/sage-devel. > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
