#18223: new categories for cartesian products with orders
-------------------------------------+-------------------------------------
Reporter: dkrenn | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.7
Component: categories | Resolution:
Keywords: sd67 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/18223 | b924b94bc2e1aa12021cc70b3a919532aa1e350a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dkrenn):
Replying to [comment:11 vdelecroix]:
> Note that the following almost works
> {{{
> B = cartesian_product([A0, A1, A2])
> my_cmp = lambda x,y: x[0] <= y[0] and x[1] <= y[1] and x[2] <= y[2]
> P = Poset((B, my_cmp))
> }}}
> I say almost, because building a `Poset` is infinitely slow as always
and works only for finite posets.
Just a short comment: This will not work for what I have in mind, since my
A0, A1, A2 will be groups or monoids or rings, and I want B to be a group
or monoid or ring, resp., as well. This is also one motivation for using
the category framework to add the desired comparison behavior to existing
structures.
--
Ticket URL: <http://trac.sagemath.org/ticket/18223#comment:12>
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.
