#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 | 01f9e1c6bb502e6044181c856bcb8984718fd237
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:36 ncohen]:
> > Yes, and it will give you subposets. Implementation is `HasseDiagram`
returns just a list of numbers. And that is what I don't want to make
public.
>
> In [comment:12] I suggested a `as_posets=True` (or any other name you
might prefer) to get a different output, i.e. as a partition of vertices
for instance. Wouldn't that solve your problem ?
Then series-parallel decomposition would call that, and then... create a
poset of them? So no luck.
With implementation at `HasseDiagram` we (read: I) can make a function to
make a series-parallel decomposition that does not create `Poset`s
recursively.
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:37>
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.
