#19123: LatticePoset: add is_vertically_decomposable
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/vertically_decomposable|
0d472a68c9edf4ddea1404ff0cb6d2f508de55d0
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> There are of course other options, like having a function (this one,
with an argument?) returning list of "decomposition elements".
+1 to that.
> How should it be defined on non-connected posets? And I am not sure if
this works with non-bounded posets; I thinked about bounded ones when
writing this.
Hmmm, okay okay... I attempted to write a definition, but indeed for non-
lattices you have 1000 different corner-cases, and th definition would be
a mess.
> (Btw, this would be nice exercise of (totally unneeded) optimization.
One should not need to look for all edged of Hasse diagram to see that a
poset is indecomposable.)
What do you mean? Your algorithm looks very reliable. I do not see it
waste much.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19123#comment:5>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
