#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: Nathann Cohen, Jori
Nathann Cohen | Mäntysalo
Report Upstream: N/A | Work issues:
Branch: public/19659 | Commit:
Dependencies: | 1385d69b99c5060821463ef513b0478a062db942
| Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> OK. Then, what should be the name of parameter (somehow `certificate`
sounds odd to me)?
'certificate' is a generic term that is used in some places already
(mostly because of me I expect), but it is not a 'standard' at all. Is
there another term you would prefer?
> And should it return the decomposition as a list of elements or as a
list of subposets?
Depends on what *you* plan to use it for.
`.is_ordinal_sum(as_posets=True)` or `.is_ordinal_sum(as_partition=True)`
would work for me, and either return an empty list (when it is not) or
return a list of whatever is requested.
If you have a better idea, of course, just name it.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:53>
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.
