On Oct 28, 5:25 pm, Roman Pearce <rpear...@gmail.com> wrote: > On Oct 28, 4:20 am, luisfe <lftab...@yahoo.es> wrote: > > > Computing with generic quotient rings I am afraid that will be slow > > and that will yield to various errors. Specially as in this case, > > where the ideal is not prime (you are looking for solutions in GF(4)). > > Doesn't GF(4) construct a field with 4 elements? It shouldn't be Z/ > 4Z. You can overcome this problem by choosing an irreducible > polynomial of degree 2 modulo 2. I'm thinking x^2+x+1 :) Add it to > the set of polynomials and compute modulo 2, and you have your own > representation of the field.
GF(4) is fine. What is not prime is the ideal (a^4+a, b^4+b, c^4+c) used to impose that all the solutions searched are in the field of four elements instead of the algebraically closed field of characteristic 2. Also, I have just realize that this mail is in sage-devel list. Please, post any further comment in the sage-support mailing list. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
