#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: Darij Grinberg,
Authors: Viviane Pons | Work issues: see TODO in
Report Upstream: N/A | comment:41
Branch: public/combinat | Commit:
/interval-posets-15683 | 8fde02be069b23dae4c02d9cd334e4650e252976
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by VivianePons):
Ok, so following the discussion with Darj and Travis.
We proved the so called "longest chain algorithm" that I had implemented
using a new statistic that we called "Tamari inversions". I put a short
version of the proof in the doc itself (because I don't think there is any
ref for this), we are working on this with Darj right now. If ever we
write a paper with the proof in it, we will add the reference!
Also, I reviewed Darj's insertion method to check if it was working and it
seemed fine.
--
Ticket URL: <http://trac.sagemath.org/ticket/15683#comment:51>
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.
