#17186: LatticePoset: faster is_modular
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_info
Priority: minor | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/latticeposet__faster_is_modular|
c2a4f3485cb5981f21a25faa9c1acc6e4379615c
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by ncohen):
* status: needs_review => needs_info
Comment:
Hello,
I was not able to find this proof at pages 286-287 of any of the two
volumes of Enumerative Combinatorics. And it would be cool to have a
correct reference to write in the function's code.
I also found a reference there, but they use <= when you use <.
https://www.math.ku.edu/~jmartin/courses/math796-S08/notes0201.pdf
By the way I do not understand why `rank_dict` should be a `dict`, as you
use it to associate things to integers between 0 and n-1... A list does
that already, and faster.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17186#comment:3>
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.
