On Thursday, November 3, 2016 at 1:06:05 PM UTC, Bill Hart wrote: > > > > On Friday, 28 October 2016 18:44:09 UTC+2, Dima Pasechnik wrote: >> >> 5 variables and degree 100 is really, really huge. Especially over QQ, >> the coefficients of >> polynomials will just totally blow. >> In fact, 5 variables and degree 10 might still be quite hard, in >> particular over QQ or other char. 0 fields. >> > > I disagree with all of the above, especially when the polynomials are > randomly generated. >
Huh? Algebraic geometers are mostly not interested in random data. With probability 1, your random data will define something irreducible. While if your data is reducible, you might need to build algebraic extensions of high degree to factor. I don't see how you can handle extensions of degrees that might pop out of the data of this format... > Bill. > > >> >> >> >> On Friday, October 28, 2016 at 7:55:02 AM UTC, Jori Mäntysalo wrote: >>> >>> On Thu, 27 Oct 2016, Dima Pasechnik wrote: >>> >>> > factorisation of multivariate polynomials is very slow. This is a fact >>> of >>> > life. >>> >>> True, but is it normal that some specific polynomial takes gigabytes, >>> whereas others show no big increase in memory use? >>> >>> I have found bugs in Singular before, and then I also used Sage to >>> generate random polynomials. >>> >>> -- >>> Jori Mäntysalo >>> >> -- 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 sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
