#19659: Poset: inverse function of ordinal_sum()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/develop | 4358a5a4574999015ccb9088bdb842dcc738d40c
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:12 ncohen]:
> > Then ordinal decomposition function in `posets.py` should return
`HasseDiagram`, which sounds odd.
>
> Why do you insist on having it return a Hasse Diagram? If you want the
decomposition feature without having to build posets, then you could have
a 'as_posets=True` optional argument in the Poset method, which would
either return a list of posets or return a partition of the elements.
This is true. But then, what's wrong with having functions at
`hasse_diagram.py`?
(In general it makes possible to do a little optimization for advanced
users. There is not always need to build poset object, if some filtering
can be done in Hasse diagrams.)
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:13>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
