#15683: Interval-posets of Tamari
-------------------------------------+-------------------------------------
Reporter: VivianePons | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: combinatorics | Resolution:
Keywords: combinat, Tamari, | Merged in:
binary trees, Dyck paths | Reviewers: Darij Grinberg,
Authors: Viviane Pons | Frederic Chapoton, Travis Scrimshaw
Report Upstream: N/A | Work issues: doc-pdf
Branch: public/combinat | Commit:
/interval-posets-15683 | c7817520a6bdf7b4dddadcf05dc293631873c489
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by darij):
OK, so it looks like Sphinx and LaTeX hate something in this:
{{{
.. SEEALSO::
:meth:`tamari_smaller`, :meth:`tamari_greater`,
:meth:`tamari_pred`, :meth:`tamari_succ`,
:meth:`tamari_interval`
EXAMPLES:
The tree
| o |
| / \ |
| o o |
| / |
| o |
| / \ |
| o o |
is Tamari-`\leq` to the tree
| _o_ |
| / \ |
| o o |
| / \ \ |
| o o o |
Checking this::
sage: b = BinaryTree([[[[], []], None], []])
sage: c = BinaryTree([[[],[]],[None,[]]])
sage: b.tamari_lequal(c)
True
TESTS::
sage: for T in BinaryTrees(4):
....: for S in T.tamari_smaller():
....: if S != T and T.tamari_lequal(S):
....: print "FAILURE"
....: if not S.tamari_lequal(T):
....: print "FAILURE"
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/15683#comment:77>
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.
