#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 | dc6ea77deba193bdf03e55ecf66a1ea1f7d3e90c
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Some thoughts, not a clear opinion yet:
We do have `ordinal_product` already. An "inverse function" of if would be
`ordinal_factors`, I think. Compare to "factoring (undirected) graphs"
(done be Nathann IIRC).
`certificate=True` sounds natural to for example `dimension`: there is not
**the** set of realizers, just bunch of minimal sets and one of them is
returned. For this function we do have exact "components", "parts" or
something like that.
There is now `is_connected` and `conneced_components`. It would be
orthogonal design to have two functions for this one also.
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:47>
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.
