On Sun, Oct 21, 2012 at 9:46 AM, Nils Bruin <nbr...@sfu.ca> wrote: > On Oct 21, 4:03 am, mmarco <mma...@unizar.es> wrote: >> That was my first idea when i encountered these problems. But then, >> things like primary decomposition rely on factorization of >> polynomials... which will differ a lot from QQbar to an algebraic >> extension of Q. > > Indeed. Data point: Magma does allow QQbar as a base ring for > polynomial rings and supports primary decomposition. Magma uses a > finite field to track dependencies rather than interval arithmetic. > That's numerically a lot simpler, except in the rare event that you > run into a polynomial with bad reduction at the chosen prime.
Is there a research paper explaining the finite field approach to QQbar? It would be good to mention it here, since implementing similar functionality Sage for computing with QQbar would be a good project for somebody. William > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To post to this group, send email to sage-devel@googlegroups.com. > To unsubscribe from this group, send email to > sage-devel+unsubscr...@googlegroups.com. > Visit this group at http://groups.google.com/group/sage-devel?hl=en. > > -- William Stein Professor of Mathematics University of Washington http://wstein.org -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
