On Thu, Oct 14, 2010 at 6:00 PM, D. Monarres <[email protected]> wrote: > Hello all, > > First off I would like to thank you for your work. Sage is a powerful > tool, but I am running into some trouble doing some things that I > assumed would be easy. > > I would like to construct a cartesian product of two groups (or rings > or fields) which overload + and * in the natural way. From what I > gather the cartesian_product function is just a combinatoric type > where none of the algebraic structure is inherited. Is there an > obvious way to do this that I am missing? Thank you in advance for any > help.
I think these have been implemented for groups. The direct product of permutation groups, for example, is defined here: http://www.sagemath.org/doc/reference/sage/groups/perm_gps/permgroup.html I'm not sure how to construct it for rings. > > David Monarres > > -- > To post to this group, send email to [email protected] > To unsubscribe from this group, send email to > [email protected] > For more options, visit this group at > http://groups.google.com/group/sage-support > URL: http://www.sagemath.org > -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
