-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Dear all,
I wonder where I can read about sage's automagic type inference. If use something like sage: R = QQ['x1,x2'] sage: (x1,x2) = R.gens() sage: J = (x1*x2, x1-x2)* R sage infers J to be an MPolynomialIdeal and makes Singular accessible. Now, I am working on a class BinomialIdeal which derives from MPolynomialIdeal and want sage to check whether an MPolynomialIdeal is in fact a binomial ideal and then type it accordingly. How could I do this ? thanks Tom -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAkk2WPMACgkQrpEWPKIUt7OcawCfW6Aru0dfV9+hXJSmBNrQ9VMg hHwAnityjkgTuR2T/pI5FYKRQZ68S8dc =7OwK -----END PGP SIGNATURE----- --~--~---------~--~----~------------~-------~--~----~ 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-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
