summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorFrédéric Chapoton <chapoton@math.univ-lyon1.fr>2018-03-01 13:25:10 +0100
committerFrédéric Chapoton <chapoton@math.univ-lyon1.fr>2018-03-01 13:25:10 +0100
commitf9301cd0657aa28480876aaa2f4ba7e251f47e6d (patch)
treecfbf4f7d638a4e040ea828313219a7eea56b988d
parenttrac 24873 some details of doc (diff)
trac 24873 adding a few SEEALSO
-rw-r--r--src/sage/combinat/interval_posets.py24
1 files changed, 24 insertions, 0 deletions
diff --git a/src/sage/combinat/interval_posets.py b/src/sage/combinat/interval_posets.py
index a32d4b4..f07a149 100644
--- a/src/sage/combinat/interval_posets.py
+++ b/src/sage/combinat/interval_posets.py
@@ -1443,6 +1443,8 @@ class TamariIntervalPoset(Element):
- ``binary_tree`` -- a binary tree
+ .. SEEALSO:: :meth:`contains_dyck_word`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(4,[(2,4),(3,4),(2,1),(3,1)])
@@ -1471,6 +1473,8 @@ class TamariIntervalPoset(Element):
- ``dyck_word`` -- a Dyck word
+ .. SEEALSO:: :meth:`contains_binary_tree`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(4,[(2,4),(3,4),(2,1),(3,1)])
@@ -1528,6 +1532,8 @@ class TamariIntervalPoset(Element):
Return the initial forest of ``self``, i.e., the interval-poset
formed from only the increasing relations of ``self``.
+ .. SEEALSO:: :meth:`final_forest`
+
EXAMPLES::
sage: TamariIntervalPoset(4,[(1,2),(3,2),(2,4),(3,4)]).initial_forest()
@@ -1543,6 +1549,8 @@ class TamariIntervalPoset(Element):
Return the final forest of ``self``, i.e., the interval-poset
formed with only the decreasing relations of ``self``.
+ .. SEEALSO:: :meth:`initial_forest`
+
EXAMPLES::
sage: TamariIntervalPoset(4,[(2,1),(3,2),(3,4),(4,2)]).final_forest()
@@ -1560,6 +1568,8 @@ class TamariIntervalPoset(Element):
It consists of checking that ``self`` does not contain any decreasing
relations.
+ .. SEEALSO:: :meth:`is_final_interval`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(4, [(1, 2), (2, 4), (3, 4)])
@@ -1584,6 +1594,8 @@ class TamariIntervalPoset(Element):
It consists of checking that ``self`` does not contain any increasing
relations.
+ .. SEEALSO:: :meth:`is_initial_interval`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(4, [(4, 3), (3, 1), (2, 1)])
@@ -1612,6 +1624,8 @@ class TamariIntervalPoset(Element):
:meth:`~sage.combinat.binary_tree.BinaryTree.to_ordered_tree_left_branch`
and cutting off the root) is the final forest of ``self``.
+ .. SEEALSO:: :meth:`lower_dyck_word`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(6,[(3,2),(4,3),(5,2),(6,5),(1,2),(4,5)]); ip
@@ -1630,6 +1644,8 @@ class TamariIntervalPoset(Element):
Return the lowest Dyck word in the interval of the Tamari lattice
represented by ``self``.
+ .. SEEALSO:: :meth:`lower_binary_tree`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(6,[(3,2),(4,3),(5,2),(6,5),(1,2),(4,5)]); ip
@@ -1654,6 +1670,8 @@ class TamariIntervalPoset(Element):
:meth:`~sage.combinat.binary_tree.BinaryTree.to_ordered_tree_right_branch`
and cutting off the root) is the initial forest of ``self``.
+ .. SEEALSO:: :meth:`upper_dyck_word`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(6,[(3,2),(4,3),(5,2),(6,5),(1,2),(4,5)]); ip
@@ -1672,6 +1690,8 @@ class TamariIntervalPoset(Element):
Return the highest Dyck word in the interval of the Tamari lattice
represented by ``self``.
+ .. SEEALSO:: :meth:`upper_binary_tree`
+
EXAMPLES::
sage: ip = TamariIntervalPoset(6,[(3,2),(4,3),(5,2),(6,5),(1,2),(4,5)]); ip
@@ -1938,6 +1958,8 @@ class TamariIntervalPoset(Element):
Not to be confused with :meth:`size` which is the number of
vertices.
+ .. SEEALSO:: :meth:`binary_trees`
+
EXAMPLES::
sage: TamariIntervalPoset(4,[(2,4),(3,4),(2,1),(3,1)]).interval_cardinality()
@@ -1954,6 +1976,8 @@ class TamariIntervalPoset(Element):
Return an iterator on all the binary trees in the interval
represented by ``self``.
+ .. SEEALSO:: :meth:`interval_cardinality`
+
EXAMPLES::
sage: list(TamariIntervalPoset(4,[(2,4),(3,4),(2,1),(3,1)]).binary_trees())