#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:27 ncohen]:
> > But I ask a reverse question: What should be in `hasse_diagram.py`?
What is the big picture of code structure in your vision?
>
> I thought about it for a moment, and I don't even think that I can give
you the name of a method that would be specific to the Hasse Diagram and
not to the poset. Do you have one in mind?
That is why this specific ticket should not be rejected for doing what
other similar code already does.
I think that actually almost all code could be at `hasse_diagram.py`!
Hence posets and lattices would be mostly a lightweight (in a code, not in
memory footprint...) wrapper handling element labels and checking input.
And in longer future there could be cythonized internal implementation,
something directly coded like your static sparse graphs backend has.
But I must admit that I have not been straight on this. See for example
#19884.
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:28>
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.
