On Mon, Mar 20, 2017 at 12:48 PM, Dima Pasechnik <dimp...@gmail.com> wrote: > > > On Monday, March 20, 2017 at 3:06:28 PM UTC, Nils Bruin wrote: >> >> On Monday, March 20, 2017 at 5:49:24 AM UTC-7, Jeroen Demeyer wrote: >>> >>> I believe that this is simply https://trac.sagemath.org/ticket/15600 >>> >>> The variable d lies in a number field of degree 32, which is rather big >>> to call polredbest() on. >> >> If the sage implementation ends up doing this then that's a good >> indication that the approach described in: >> >> Allan K. Steel, Computing with algebraically closed fields, Journal of >> Symbolic Computation, Volume 45, Issue 3, March 2010, Pages 342-372, ISSN >> 0747-7171, http://dx.doi.org/10.1016/j.jsc.2009.09.005. >> >> would really be much better. It would avoid any number field computations. >> If an embedding in CC or RR is required, it could be tracked with just >> numerical information. >> One would use finite fields to track identity. >> If there's such a use for QQbar, it might be interesting to run a project >> in that direction. >> > this is about algebraically closed fields; IMHO real fields are harder.
The original poster is asking only about basic arithmetic and equality testing in AA. Since AA embeds as a subfield of QQbar, a solution to these problems in QQbar automatically implies one in AA. William -- William (http://wstein.org) -- 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.
