#18002: Submonoids and subsemigroup defined by generators
-------------------------------------------------+-------------------------
Reporter: virmaux | Owner:
Type: enhancement | Status: closed
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution: fixed
Keywords: monoids, days64 | Merged in:
Authors: Nicolas M. Thiéry, Aladin | Reviewers: Anne
Virmaux | Schilling
Report Upstream: N/A | Work issues:
Branch: | Commit:
a8306e4da2265d06e6fc20ca3f16989632132fee | Stopgaps:
Dependencies: #17160 |
-------------------------------------------------+-------------------------
Changes (by nthiery):
* commit: a8306e4da2265d06e6fc20ca3f16989632132fee =>
Comment:
Replying to [comment:58 vdelecroix]:
> The example in the description is precisely an example where we want to
override the method `.submonoid()` since everything can be computed using
`gcd`!
We are looking for a multiplicative monoid here, not additive. So I don't
see from the top of my head how to do it with `gcd`. I might be missing
something though. And I certainly agree that there must be some better way
than brute force in such a specific situation. I was just looking for a
simple example where one can easily check things by hand.
--
Ticket URL: <http://trac.sagemath.org/ticket/18002#comment:60>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
