summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorFrédéric Chapoton <chapoton@math.univ-lyon1.fr>2018-06-20 16:32:01 +0200
committerFrédéric Chapoton <chapoton@math.univ-lyon1.fr>2018-06-20 16:32:01 +0200
commit7a788f7128bb012b5e53fe56bcc27c81477399ca (patch)
treee85647c216cfc5c873fa5c003c637d04967f4031
parentUpdated SageMath version to 8.3.beta6 (diff)
fix bad escape sequences in the doc of combinat folder
-rw-r--r--src/sage/combinat/abstract_tree.py4
-rw-r--r--src/sage/combinat/affine_permutation.py2
-rw-r--r--src/sage/combinat/alternating_sign_matrix.py7
-rw-r--r--src/sage/combinat/binary_tree.py12
-rw-r--r--src/sage/combinat/cartesian_product.py6
-rw-r--r--src/sage/combinat/colored_permutations.py4
-rw-r--r--src/sage/combinat/combinat.py9
-rw-r--r--src/sage/combinat/combinatorial_algebra.py7
-rw-r--r--src/sage/combinat/diagram_algebras.py5
-rw-r--r--src/sage/combinat/dyck_word.py2
-rw-r--r--src/sage/combinat/finite_state_machine.py7
-rw-r--r--src/sage/combinat/finite_state_machine_generators.py15
-rw-r--r--src/sage/combinat/free_module.py8
-rw-r--r--src/sage/combinat/fully_packed_loop.py3
-rw-r--r--src/sage/combinat/gelfand_tsetlin_patterns.py2
-rw-r--r--src/sage/combinat/interval_posets.py2
-rw-r--r--src/sage/combinat/kazhdan_lusztig.py2
-rw-r--r--src/sage/combinat/knutson_tao_puzzles.py16
-rw-r--r--src/sage/combinat/lr_tableau.py4
-rw-r--r--src/sage/combinat/non_decreasing_parking_function.py7
-rw-r--r--src/sage/combinat/partition.py4
-rw-r--r--src/sage/combinat/partition_algebra.py10
-rw-r--r--src/sage/combinat/partition_kleshchev.py4
-rw-r--r--src/sage/combinat/partition_tuple.py12
-rw-r--r--src/sage/combinat/permutation.py22
-rw-r--r--src/sage/combinat/set_partition.py6
-rw-r--r--src/sage/combinat/set_partition_ordered.py9
-rw-r--r--src/sage/combinat/similarity_class_type.py7
-rw-r--r--src/sage/combinat/skew_tableau.py7
-rw-r--r--src/sage/combinat/sloane_functions.py6
-rw-r--r--src/sage/combinat/subset.py3
-rw-r--r--src/sage/combinat/subsets_pairwise.py2
-rw-r--r--src/sage/combinat/symmetric_group_algebra.py10
-rw-r--r--src/sage/combinat/tableau.py14
34 files changed, 126 insertions, 114 deletions
diff --git a/src/sage/combinat/abstract_tree.py b/src/sage/combinat/abstract_tree.py
index 4ced7fc..0babcf4 100644
--- a/src/sage/combinat/abstract_tree.py
+++ b/src/sage/combinat/abstract_tree.py
@@ -1397,7 +1397,7 @@ class AbstractTree(object):
return "".join(["%x" % len(self)] + [u.to_hexacode() for u in self])
def tree_factorial(self):
- """
+ r"""
Return the tree-factorial of ``self``.
Definition:
@@ -1460,7 +1460,7 @@ class AbstractTree(object):
begin_env = "\\begin{tikzpicture}[auto]\n"
end_env = "\\end{tikzpicture}"
# it uses matrix trick to place each node
- matrix_begin = "\\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{\n"
+ matrix_begin = "\\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\\&]{\n"
matrix_end = "\\\\\n};\n"
# a basic path to each edges
path_begin = "\\path[ultra thick, red] "
diff --git a/src/sage/combinat/affine_permutation.py b/src/sage/combinat/affine_permutation.py
index 8ee11ec..6ef43993 100644
--- a/src/sage/combinat/affine_permutation.py
+++ b/src/sage/combinat/affine_permutation.py
@@ -1767,7 +1767,7 @@ class AffinePermutationTypeG(AffinePermutation):
#-------------------------------------------------------------------------
def AffinePermutationGroup(cartan_type):
- """
+ r"""
Wrapper function for specific affine permutation groups.
These are combinatorial implementations of the affine Weyl groups of
diff --git a/src/sage/combinat/alternating_sign_matrix.py b/src/sage/combinat/alternating_sign_matrix.py
index 0607ccc..ce2f399 100644
--- a/src/sage/combinat/alternating_sign_matrix.py
+++ b/src/sage/combinat/alternating_sign_matrix.py
@@ -1935,12 +1935,13 @@ class ContreTableaux_n(ContreTableaux):
def _next_column_iterator(previous_column, height, i = None):
- """
+ r"""
Return a generator for all columns of height ``height``
properly filled from row 1 to ``i``.
- ("Properly filled" means strictly increasing and having
+
+ "Properly filled" means strictly increasing and having
the property that the `k`-th entry is `\geq` to the `k`-th
- entry of ``previous_column`` for each `k`.)
+ entry of ``previous_column`` for each `k`.
EXAMPLES::
diff --git a/src/sage/combinat/binary_tree.py b/src/sage/combinat/binary_tree.py
index 06c18ba..1ac89b9 100644
--- a/src/sage/combinat/binary_tree.py
+++ b/src/sage/combinat/binary_tree.py
@@ -170,7 +170,7 @@ class BinaryTree(AbstractClonableTree, ClonableArray):
return BinaryTrees_all()
def __init__(self, parent, children=None, check=True):
- """
+ r"""
TESTS::
sage: BinaryTree([None, None]).parent()
@@ -1891,7 +1891,7 @@ class BinaryTree(AbstractClonableTree, ClonableArray):
return tree
def canopee(self):
- """
+ r"""
Return the canopee of ``self``.
The *canopee* of a non-empty binary tree `T` with `n` internal nodes is
@@ -1961,7 +1961,7 @@ class BinaryTree(AbstractClonableTree, ClonableArray):
return res[1:-1]
def in_order_traversal_iter(self):
- """
+ r"""
The depth-first infix-order traversal iterator for the binary
tree ``self``.
@@ -2474,7 +2474,7 @@ class BinaryTree(AbstractClonableTree, ClonableArray):
[B([self[0], d]) for d in self[1].tamari_succ()])
def single_edge_cut_shapes(self):
- """
+ r"""
Return the list of possible single-edge cut shapes for the binary tree.
This is used in :meth:`sage.combinat.interval_posets.TamariIntervalPoset.is_new`.
@@ -4806,7 +4806,7 @@ class LabelledBinaryTree(AbstractLabelledClonableTree, BinaryTree):