#15683: Interval-posets of Tamari
-------------------------------------+-------------------------------------
Reporter: VivianePons | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: combinat, Tamari, | Merged in:
binary trees, Dyck paths | Reviewers:
Authors: Viviane Pons | Work issues: make import lazy,
Report Upstream: N/A | review
Branch: public/combinat | Commit:
/interval-posets-15683 | 058d7bf6c7c9aba92fef6fd9b0648e5db05fcfaa
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by VivianePons):
> EDIT: could it be that what you call a binary search tree of a
permutation p is `p.binary_search_tree(left_to_right=False)`? That should
be easy to document.
Yes, it is exactly that. Indeed, in all the papers I know, the binary
search tree of a permutation is always taken from right to left. And then
the linear extensions are read from leaves to root which is also common.
I guess the 'binary_search_tree' method had been implemented before from
left to right and so to keep it consistent, only a parameter was added.
You can make it explicit in the documentation wherever it is needed!
Don't worry about the delay, it is nice enough of you to work on this, no
time pressure!
--
Ticket URL: <http://trac.sagemath.org/ticket/15683#comment:30>
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/groups/opt_out.
