passagemath-combinat 10.6.1rc3__cp311-cp311-win_amd64.whl → 10.6.44__cp311-cp311-win_amd64.whl

sage/combinat/degree_sequences.pyx

@@ -244,9 +244,9 @@ The sequences produced by random graphs *are* degree sequences::
 
 Checking that we indeed enumerate *all* the degree sequences for `n=5`::
 
-    sage: ds1 = Set([tuple(g.degree_sequence()) for g in graphs(5)])                    # needs sage.graphs
+    sage: ds1 = Set([tuple(g.degree_sequence()) for g in graphs(5)])                    # needs nauty sage.graphs
     sage: ds2 = Set(map(tuple,list(DegreeSequences(5))))
-    sage: ds1 == ds2                                                                    # needs sage.graphs
+    sage: ds1 == ds2                                                                    # needs nauty sage.graphs
     True
 
 Checking the consistency of enumeration and test::

sage/combinat/diagram_algebras.py

@@ -358,7 +358,7 @@ class AbstractPartitionDiagram(AbstractSetPartition):
             sage: pd2 = da.AbstractPartitionDiagram(pd, [[[1,2],[-1,-2]]]) # indirect doctest
             Traceback (most recent call last):
             ...
-            TypeError: unhashable type: 'list'
+            TypeError: ...unhashable type: 'list'...
         """
         if self._base_diagram:
             tst = frozenset(e for B in self._base_diagram for e in B)

sage/combinat/gelfand_tsetlin_patterns.py

@@ -521,7 +521,7 @@ class GelfandTsetlinPattern(ClonableArray,
 
             sage: G = GelfandTsetlinPattern([[3,2,0],[2.2,0],[2]])
             sage: G.bender_knuth_involution(2)
-            [[3, 2, 0], [2.80000000000000, 2], [2]]
+            [[3, 2, 0], [2.8..., 2], [2]]
 
         TESTS::
 

sage/combinat/growth.py

@@ -2427,6 +2427,7 @@ class RuleLLMS(Rule):
 
         EXAMPLES::
 
+            sage: # needs sage.modules
             sage: LLMS4 = GrowthDiagram.rules.LLMS(4)
             sage: v = LLMS4.vertices(3)[1]; v
             [2, 1]
@@ -3711,12 +3712,12 @@ class RuleRSK(RulePartitions):
     Instead of passing the rule to :class:`GrowthDiagram`, we can
     also call the rule to create growth diagrams.  For example::
 
+        sage: # needs sage.modules
         sage: m = matrix([[0,0,0,0,1],[1,1,0,2,0], [0,3,0,0,0]])
         sage: G = RuleRSK(m); G
         0  0  0  0  1
         1  1  0  2  0
         0  3  0  0  0
-
         sage: ascii_art([G.P_symbol(), G.Q_symbol()])
         [   1  2  2  2  3    1  2  2  2  2 ]
         [   2  3             4  4          ]
@@ -3736,13 +3737,12 @@ class RuleRSK(RulePartitions):
     Because the of the coordinate conventions in
     :func:`~sage.combinat.rsk.RSK`, we have to transpose matrices::
 
+        sage: # needs sage.modules
         sage: [G.P_symbol(), G.Q_symbol()] == RSK(m.transpose())
         True
-
         sage: n = 5; l = [(pi, RuleRSK(pi)) for pi in Permutations(n)]
         sage: all([G.P_symbol(), G.Q_symbol()] == RSK(pi) for pi, G in l)
         True
-
         sage: n = 5; l = [(w, RuleRSK(w)) for w in Words([1,2,3], 5)]
         sage: all([G.P_symbol(), G.Q_symbol()] == RSK(pi) for pi, G in l)
         True
@@ -3876,12 +3876,12 @@ class RuleBurge(RulePartitions):
     Instead of passing the rule to :class:`GrowthDiagram`, we can
     also call the rule to create growth diagrams.  For example::
 
+        sage: # needs sage.modules
         sage: m = matrix([[2,0,0,1,0],[1,1,0,0,0], [0,0,0,0,3]])
         sage: G = Burge(m); G
         2  0  0  1  0
         1  1  0  0  0
         0  0  0  0  3
-
         sage: ascii_art([G.P_symbol(), G.Q_symbol()])
         [   1  2  3    1  2  5 ]
         [   1  3       1  5    ]

sage/combinat/matrices/hadamard_matrix.py

@@ -350,20 +350,21 @@ def hadamard_matrix_from_symmetric_conference_matrix(n, existence=False, check=T
     By default the function returns the Hadamard matrix ::
 
         sage: from sage.combinat.matrices.hadamard_matrix import hadamard_matrix_from_symmetric_conference_matrix
-        sage: hadamard_matrix_from_symmetric_conference_matrix(20)
+        sage: hadamard_matrix_from_symmetric_conference_matrix(20)                      # needs database_graphs
         20 x 20 dense matrix over Integer Ring...
 
     If ``existence`` is set to True, the function returns True if the matrix exists,
     False if the conference matrix does not exist, and Unknown if the conference
     matrix cannot be constructed yet ::
 
-        sage: hadamard_matrix_from_symmetric_conference_matrix(12, existence=True)
+        sage: hadamard_matrix_from_symmetric_conference_matrix(12, existence=True)      # needs database_graphs
         True
-        sage: hadamard_matrix_from_symmetric_conference_matrix(4*787, existence=True)
+        sage: hadamard_matrix_from_symmetric_conference_matrix(4*787, existence=True)   # needs database_graphs
         True
 
     TESTS::
 
+        sage: # needs database_graphs
         sage: from sage.combinat.matrices.hadamard_matrix import is_hadamard_matrix
         sage: is_hadamard_matrix(hadamard_matrix_from_symmetric_conference_matrix(60, check=False))
         True
@@ -430,16 +431,17 @@ def hadamard_matrix_miyamoto_construction(n, existence=False, check=True):
     By default the function returns the Hadamard matrix ::
 
         sage: from sage.combinat.matrices.hadamard_matrix import hadamard_matrix_miyamoto_construction
-        sage: hadamard_matrix_miyamoto_construction(20)
+        sage: hadamard_matrix_miyamoto_construction(20)                                 # needs database_graphs
         20 x 20 dense matrix over Integer Ring...
 
     If ``existence`` is set to True, the function returns a boolean ::
 
-        sage: hadamard_matrix_miyamoto_construction(36, existence=True)
+        sage: hadamard_matrix_miyamoto_construction(36, existence=True)                 # needs database_graphs
         True
 
     TESTS::
 
+        sage: # needs database_graphs
         sage: from sage.combinat.matrices.hadamard_matrix import is_hadamard_matrix
         sage: is_hadamard_matrix(hadamard_matrix_miyamoto_construction(68, check=False))
         True
@@ -1808,7 +1810,7 @@ def hadamard_matrix(n, existence=False, check=True, construction_name=False):
         False
         sage: matrix.hadamard(12,existence=True)
         True
-        sage: matrix.hadamard(668,existence=True)
+        sage: matrix.hadamard(668,existence=True)                                       # needs database_graphs
         Unknown
         sage: matrix.hadamard(10)
         Traceback (most recent call last):
@@ -1960,7 +1962,7 @@ def hadamard_matrix_www(url_file, comments=False):
         [ 1 -1 -1  1  1  1 -1 -1 -1  1  1 -1 -1 -1  1  1]
         [ 1 -1 -1  1 -1 -1  1  1 -1  1  1 -1  1  1 -1 -1]
     """
-    n = eval(url_file.split(".")[1])
+    n = int(url_file.split(".")[1])
     rws = []
     url = "http://neilsloane.com/hadamard/" + url_file
     with urlopen(url) as f:
@@ -2037,7 +2039,7 @@ def regular_symmetric_hadamard_matrix_with_constant_diagonal(n, e, existence=Fal
 
     Recursive construction::
 
-        sage: regular_symmetric_hadamard_matrix_with_constant_diagonal(144,-1)
+        sage: regular_symmetric_hadamard_matrix_with_constant_diagonal(144,-1)    # needs database_graphs
         144 x 144 dense matrix over Integer Ring (use the '.str()' method to see the entries)
 
     REFERENCE:
@@ -3378,7 +3380,7 @@ def symmetric_conference_matrix(n, check=True, existence=False):
     EXAMPLES::
 
         sage: from sage.combinat.matrices.hadamard_matrix import symmetric_conference_matrix
-        sage: C = symmetric_conference_matrix(10); C
+        sage: C = symmetric_conference_matrix(10); C                              # needs database_graphs
         [ 0  1  1  1  1  1  1  1  1  1]
         [ 1  0 -1 -1  1 -1  1  1  1 -1]
         [ 1 -1  0 -1  1  1 -1 -1  1  1]
@@ -3389,7 +3391,7 @@ def symmetric_conference_matrix(n, check=True, existence=False):
         [ 1  1 -1  1  1  1 -1  0 -1 -1]
         [ 1  1  1 -1 -1  1  1 -1  0 -1]
         [ 1 -1  1  1  1 -1  1 -1 -1  0]
-        sage: C^2 == 9*identity_matrix(10) and C == C.T
+        sage: C^2 == 9*identity_matrix(10) and C == C.T                           # needs database_graphs
         True
     """
     from sage.graphs.strongly_regular_db import strongly_regular_graph as srg
@@ -3505,6 +3507,7 @@ def rshcd_from_prime_power_and_conference_matrix(n):
 
     A 36x36 example ::
 
+        sage: # needs database_graphs
         sage: from sage.combinat.matrices.hadamard_matrix import rshcd_from_prime_power_and_conference_matrix
         sage: from sage.combinat.matrices.hadamard_matrix import is_hadamard_matrix
         sage: H = rshcd_from_prime_power_and_conference_matrix(7); H
@@ -3514,6 +3517,7 @@ def rshcd_from_prime_power_and_conference_matrix(n):
 
     Bigger examples, only provided by this construction ::
 
+        sage: # needs database_graphs
         sage: H = rshcd_from_prime_power_and_conference_matrix(27)  # long time
         sage: H == H.T and is_hadamard_matrix(H)                    # long time
         True
@@ -3522,7 +3526,7 @@ def rshcd_from_prime_power_and_conference_matrix(n):
 
     In this example the conference matrix is not Paley, as 45 is not a prime power ::
 
-        sage: H = rshcd_from_prime_power_and_conference_matrix(47)  # not tested (long time)
+        sage: H = rshcd_from_prime_power_and_conference_matrix(47)  # not tested (long time), needs database_graphs
 
     REFERENCE:
 

sage/combinat/ncsf_qsym/ncsf.py

@@ -576,7 +576,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
 
                 EXAMPLES::
 
-                    sage: # needs lrcalc
+                    sage: # needs lrcalc_python
                     sage: N = NonCommutativeSymmetricFunctions(QQ)
                     sage: R = N.ribbon()
                     sage: x = R.an_element(); x
@@ -1044,7 +1044,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
 
                 Testing the `\pi(f^{\ast}) = \pi(f)` relation noticed above::
 
-                    sage: # needs lrcalc
+                    sage: # needs lrcalc_python
                     sage: NSym = NonCommutativeSymmetricFunctions(QQ)
                     sage: R = NSym.R()
                     sage: all( R(I).star_involution().to_symmetric_function()
@@ -1170,7 +1170,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
                 Testing the `\pi(\omega(f)) = \omega(\pi(f))` relation noticed
                 above::
 
-                    sage: # needs lrcalc
+                    sage: # needs lrcalc_python
                     sage: NSym = NonCommutativeSymmetricFunctions(QQ)
                     sage: R = NSym.R()
                     sage: all( R(I).omega_involution().to_symmetric_function()
@@ -1284,7 +1284,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
 
                     sage: NSym = NonCommutativeSymmetricFunctions(QQ)
                     sage: R = NSym.R()
-                    sage: all( R(I).psi_involution().to_symmetric_function()
+                    sage: all( R(I).psi_involution().to_symmetric_function()            # needs lrcalc_python
                     ....:      == R(I).to_symmetric_function().omega()
                     ....:      for I in Compositions(4) )
                     True
@@ -1296,7 +1296,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
                     sage: M = QSym.M()
                     sage: NSym = NonCommutativeSymmetricFunctions(QQ)
                     sage: S = NSym.S()
-                    sage: all( all( M(I).psi_involution().duality_pairing(S(J))
+                    sage: all( all( M(I).psi_involution().duality_pairing(S(J))         # needs lrcalc_python
                     ....:           == M(I).duality_pairing(S(J).psi_involution())
                     ....:           for I in Compositions(2) )
                     ....:      for J in Compositions(3) )
@@ -1497,7 +1497,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
                     ....:             if x != y:
                     ....:                 return False
                     ....:     return True
-                    sage: testpi(3)                                                     # needs lrcalc
+                    sage: testpi(3)                                                     # needs lrcalc_python
                     True
 
                 TESTS::
@@ -1682,7 +1682,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
 
                 EXAMPLES::
 
-                    sage: # needs lrcalc
+                    sage: # needs lrcalc_python
                     sage: N = NonCommutativeSymmetricFunctions(QQ)
                     sage: R = N.ribbon()
                     sage: x = R.an_element(); x
@@ -2669,7 +2669,7 @@ class NonCommutativeSymmetricFunctions(UniqueRepresentation, Parent):
 
             EXAMPLES::
 
-                sage: # needs lrcalc
+                sage: # needs lrcalc_python
                 sage: R = NonCommutativeSymmetricFunctions(QQ).R()
                 sage: R.to_symmetric_function_on_basis(Composition([3,1,1]))
                 s[3, 1, 1]

sage/combinat/parallelogram_polyomino.py

@@ -569,7 +569,7 @@ class _drawing_tool:
 
     EXAMPLES::
 
-        sage: # needs sage.plot
+        sage: # needs sage.plot sage.symbolic
         sage: from sage.combinat.parallelogram_polyomino import (
         ....:     _drawing_tool, default_tikz_options,
         ....:     ParallelogramPolyominoesOptions
@@ -606,7 +606,7 @@ class _drawing_tool:
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: from sage.combinat.parallelogram_polyomino import (
             ....:     _drawing_tool, default_tikz_options,
             ....:     ParallelogramPolyominoesOptions
@@ -645,7 +645,7 @@ class _drawing_tool:
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: from sage.combinat.parallelogram_polyomino import (
             ....:     _drawing_tool, ParallelogramPolyominoesOptions
             ....: )
@@ -756,7 +756,7 @@ class _drawing_tool:
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: from sage.combinat.parallelogram_polyomino import (
             ....:     _drawing_tool, ParallelogramPolyominoesOptions
             ....: )
@@ -796,7 +796,7 @@ class _drawing_tool:
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: from sage.combinat.parallelogram_polyomino import (
             ....:     _drawing_tool, ParallelogramPolyominoesOptions
             ....: )
@@ -833,7 +833,7 @@ class _drawing_tool:
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: from sage.combinat.parallelogram_polyomino import (
             ....:     _drawing_tool, ParallelogramPolyominoesOptions
             ....: )
@@ -1463,7 +1463,7 @@ class ParallelogramPolyomino(ClonableList,
             ....:         [1, 1, 0, 1, 1, 0, 0, 0, 1, 0]
             ....:     ]
             ....: )
-            sage: pp._to_binary_tree_Aval_Boussicault()
+            sage: pp._to_binary_tree_Aval_Boussicault()                                 # needs sage.graphs
             [[., [[., .], [[., [., .]], .]]], [[., .], .]]
 
             sage: pp = ParallelogramPolyomino([[0, 1], [1, 0]])
@@ -1522,7 +1522,7 @@ class ParallelogramPolyomino(ClonableList,
             ....:         [1, 1, 0, 1, 1, 0, 0, 0, 1, 0]
             ....:     ]
             ....: )
-            sage: pp.to_binary_tree()
+            sage: pp.to_binary_tree()                                                   # needs sage.graphs
             [[., [[., .], [[., [., .]], .]]], [[., .], .]]
 
             sage: pp = ParallelogramPolyomino([[0, 1], [1, 0]])
@@ -2703,7 +2703,7 @@ class ParallelogramPolyomino(ClonableList,
 
         TESTS::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino(
             ....:     [[0, 0, 1, 0, 0, 0, 1, 1], [1, 0, 1, 1, 0, 0, 0, 0]]
             ....: )
@@ -2772,7 +2772,7 @@ class ParallelogramPolyomino(ClonableList,
 
         TESTS::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino(
             ....:     [[0, 0, 0, 1, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1, 0, 0]]
             ....: )
@@ -2886,7 +2886,7 @@ class ParallelogramPolyomino(ClonableList,
 
         TESTS::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino(
             ....:     [[0, 0, 0, 1, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1, 0, 0]]
             ....: )
@@ -3509,7 +3509,7 @@ class ParallelogramPolyomino(ClonableList,
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino(
             ....:     [[0,0,0,1,1,0,1,0,0,1,1,1],[1,1,1,0,0,1,1,0,0,1,0,0]]
             ....: )
@@ -3887,7 +3887,7 @@ class ParallelogramPolyomino(ClonableList,
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino([[0,1],[1,0]])
             sage: latex(pp)
             <BLANKLINE>
@@ -3906,7 +3906,7 @@ class ParallelogramPolyomino(ClonableList,
 
         EXAMPLES::
 
-            sage: # needs sage.plot
+            sage: # needs sage.plot sage.symbolic
             sage: pp = ParallelogramPolyomino([[0,1],[1,0]])
             sage: print(pp._latex_drawing())
             <BLANKLINE>

sage/combinat/partition_algebra.py

@@ -115,10 +115,10 @@ def SetPartitionsAk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: A3.last() #random
         {{-1}, {-2}, {3}, {1}, {-3}, {2}}
-        sage: A3.random_element()  #random
+        sage: A3.random_element()  #random                                              # needs sage.symbolic
         {{1, 3, -3, -1}, {2, -2}}
 
-        sage: A3.cardinality()
+        sage: A3.cardinality()                                                          # needs sage.libs.flint
         203
 
         sage: A2p5 = SetPartitionsAk(2.5); A2p5
@@ -130,7 +130,7 @@ def SetPartitionsAk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: A2p5.last() #random
         {{-1}, {-2}, {2}, {3, -3}, {1}}
-        sage: A2p5.random_element() #random
+        sage: A2p5.random_element() #random                                             # needs sage.symbolic
         {{-1}, {-2}, {3, -3}, {1, 2}}
     """
     is_int, k = _int_or_half_int(k)
@@ -272,7 +272,7 @@ def SetPartitionsSk(k):
         {{2, -2}, {3, -3}, {1, -1}}
         sage: S3.last() #random
         {{1, -3}, {2, -2}, {3, -1}}
-        sage: S3.random_element() #random
+        sage: S3.random_element() #random                                               # needs sage.symbolic
         {{1, -3}, {2, -1}, {3, -2}}
 
         sage: S3p5 = SetPartitionsSk(3.5); S3p5
@@ -291,7 +291,7 @@ def SetPartitionsSk(k):
         {{2, -2}, {3, -3}, {1, -1}, {4, -4}}
         sage: S3p5.last() #random
         {{1, -3}, {2, -2}, {4, -4}, {3, -1}}
-        sage: S3p5.random_element() #random
+        sage: S3p5.random_element() #random                                             # needs sage.symbolic
         {{1, -3}, {2, -2}, {4, -4}, {3, -1}}
     """
     is_int, k = _int_or_half_int(k)
@@ -460,7 +460,7 @@ def SetPartitionsIk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: I3.last() #random
         {{-1}, {-2}, {3}, {1}, {-3}, {2}}
-        sage: I3.random_element() #random
+        sage: I3.random_element() #random                                               # needs sage.symbolic
         {{-1}, {-3, -2}, {2, 3}, {1}}
 
         sage: I2p5 = SetPartitionsIk(2.5); I2p5
@@ -472,7 +472,7 @@ def SetPartitionsIk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: I2p5.last() #random
         {{-1}, {-2}, {2}, {3, -3}, {1}}
-        sage: I2p5.random_element() #random
+        sage: I2p5.random_element() #random                                             # needs sage.symbolic
         {{-1}, {-2}, {1, 3, -3}, {2}}
     """
     is_int, k = _int_or_half_int(k)
@@ -616,11 +616,12 @@ def SetPartitionsBk(k):
         sage: B3 = SetPartitionsBk(3); B3
         Set partitions of {1, ..., 3, -1, ..., -3} with block size 2
 
+        sage: # needs sage.graphs
         sage: B3.first() #random
         {{2, -2}, {1, -3}, {3, -1}}
         sage: B3.last() #random
         {{1, 2}, {3, -2}, {-3, -1}}
-        sage: B3.random_element() #random
+        sage: B3.random_element() #random                                               # needs sage.symbolic
         {{2, -1}, {1, -3}, {3, -2}}
 
         sage: B3.cardinality()
@@ -629,11 +630,12 @@ def SetPartitionsBk(k):
         sage: B2p5 = SetPartitionsBk(2.5); B2p5
         Set partitions of {1, ..., 3, -1, ..., -3} with 3 and -3 in the same block and with block size 2
 
+        sage: # needs sage.graphs
         sage: B2p5.first() #random
         {{2, -1}, {3, -3}, {1, -2}}
         sage: B2p5.last() #random
         {{1, 2}, {3, -3}, {-1, -2}}
-        sage: B2p5.random_element() #random
+        sage: B2p5.random_element() #random                                             # needs sage.symbolic
         {{2, -2}, {3, -3}, {1, -1}}
 
         sage: B2p5.cardinality()
@@ -703,14 +705,14 @@ class SetPartitionsBk_k(SetPartitionsAk_k):
         """
         TESTS::
 
-            sage: SetPartitionsBk(1).list()
+            sage: SetPartitionsBk(1).list()                                             # needs sage.graphs
             [{{-1, 1}}]
 
         ::
 
-            sage: SetPartitionsBk(2).list() #random
+            sage: SetPartitionsBk(2).list() #random                                     # needs sage.graphs
             [{{2, -1}, {1, -2}}, {{2, -2}, {1, -1}}, {{1, 2}, {-1, -2}}]
-            sage: SetPartitionsBk(3).list() #random
+            sage: SetPartitionsBk(3).list() #random                                     # needs sage.graphs
             [{{2, -2}, {1, -3}, {3, -1}},
              {{2, -1}, {1, -3}, {3, -2}},
              {{1, -3}, {2, 3}, {-1, -2}},
@@ -733,7 +735,7 @@ class SetPartitionsBk_k(SetPartitionsAk_k):
         ::
 
             sage: bks = [SetPartitionsBk(i) for i in range(1, 6)]
-            sage: all(bk.cardinality() == len(bk.list()) for bk in bks)
+            sage: all(bk.cardinality() == len(bk.list()) for bk in bks)                 # needs sage.graphs
             True
         """
         for sp in SetPartitions(self._set, [2] * (len(self._set) // 2)):
@@ -833,7 +835,7 @@ def SetPartitionsPk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: P3.last() #random
         {{-1}, {-2}, {3}, {1}, {-3}, {2}}
-        sage: P3.random_element() #random
+        sage: P3.random_element() #random                                               # needs sage.symbolic
         {{1, 2, -1}, {-3}, {3, -2}}
 
         sage: P2p5 = SetPartitionsPk(2.5); P2p5
@@ -845,7 +847,7 @@ def SetPartitionsPk(k):
         {{1, 2, 3, -1, -3, -2}}
         sage: P2p5.last() #random
         {{-1}, {-2}, {2}, {3, -3}, {1}}
-        sage: P2p5.random_element() #random
+        sage: P2p5.random_element() #random                                             # needs sage.symbolic
         {{1, 2, 3, -3}, {-1, -2}}
     """
     is_int, k = _int_or_half_int(k)
@@ -1002,7 +1004,7 @@ def SetPartitionsTk(k):
         {{1, -3}, {2, 3}, {-1, -2}}
         sage: T3.last()              # random
         {{1, 2}, {3, -1}, {-3, -2}}
-        sage: T3.random_element()    # random
+        sage: T3.random_element()    # random                                           # needs sage.symbolic
         {{1, -3}, {2, 3}, {-1, -2}}
 
         sage: T2p5 = SetPartitionsTk(2.5); T2p5

sage/combinat/path_tableaux/dyck_path.py

@@ -139,7 +139,7 @@ class DyckPath(PathTableau):
             sage: path_tableaux.DyckPath([0,1,2.5,1,0])
             Traceback (most recent call last):
             ...
-            ValueError: [0, 1, 2.50000000000000, 1, 0] is not a sequence of integers
+            ValueError: [0, 1, 2.5..., 1, 0] is not a sequence of integers
             sage: path_tableaux.DyckPath(Partition([3,2,1]))
             Traceback (most recent call last):
             ...

sage/combinat/path_tableaux/semistandard.py

@@ -137,7 +137,7 @@ class SemistandardPathTableau(PathTableau):
         [(), (5/2,), (7/2, 2)]
 
         sage: path_tableaux.SemistandardPathTableau([[], [2.5], [3.5,2]])
-        [(), (2.50000000000000,), (3.50000000000000, 2)]
+        [(), (2.5...,), (3.5..., 2)]
     """
 
     @staticmethod

sage/combinat/plane_partition.py

@@ -662,7 +662,7 @@ class PlanePartition(ClonableArray,
         EXAMPLES::
 
             sage: PP = PlanePartition([[4,3,3,1],[2,1,1],[1,1]])
-            sage: PP.plot()                                                             # needs sage.plot
+            sage: PP.plot()                                                             # needs sage.plot sage.symbolic
             Graphics object consisting of 27 graphics primitives
         """
         from sage.functions.trig import cos, sin

sage/combinat/quickref.py

@@ -49,7 +49,7 @@ Polytopes::
 
     sage: points = random_matrix(ZZ, 6, 3, x=7).rows()                                  # needs sage.modules
     sage: L = LatticePolytope(points)                                                   # needs sage.geometry.polyhedron sage.modules
-    sage: L.npoints(); L.plot3d()                           # random                    # needs sage.geometry.polyhedron sage.modules sage.plot
+    sage: L.npoints(); L.plot3d()                           # random                    # needs palp sage.geometry.polyhedron sage.modules sage.plot
 
 :ref:`Root systems, Coxeter and Weyl groups <sage.combinat.root_system.all>`::
 

sage/combinat/ribbon_shaped_tableau.py

@@ -453,7 +453,7 @@ class StandardRibbonShapedTableaux_shape(StandardRibbonShapedTableaux):
 
         EXAMPLES::
 
-            sage: [t for t in StandardRibbonShapedTableaux([2,2])]                      # needs sage.graphs
+            sage: [t for t in StandardRibbonShapedTableaux([2,2])]                      # needs sage.graphs sage.modules
             [[[None, 1, 3], [2, 4]],
              [[None, 1, 2], [3, 4]],
              [[None, 2, 3], [1, 4]],

sage/combinat/sf/character.py

@@ -100,7 +100,7 @@ class Character_generic(SFA_generic):
             sage: s = Sym.s()
             sage: st._other_to_self(s[1] + s([]))
             2*st[] + st[1]
-            sage: 7 * st[[]] * st[[]]
+            sage: 7 * st[[]] * st[[]]                                                   # needs lrcalc_python
             7*st[]
         """
         if sexpr == 0:
@@ -182,7 +182,7 @@ class InducedTrivialCharacterBasis(Character_generic):
         st[] + 2*st[1] + st[1, 1] + 2*st[2] + st[2, 1] + st[3]
         sage: ht(st[2,1])
         ht[1] - ht[1, 1] + ht[2, 1] - ht[3]
-        sage: ht[2]*ht[1,1]
+        sage: ht[2]*ht[1,1]                                                             # needs lrcalc_python
         ht[1, 1] + 2*ht[1, 1, 1] + ht[2, 1, 1]
         sage: h[4,2].kronecker_product(h[4,1,1])
         h[2, 2, 1, 1] + 2*h[3, 1, 1, 1] + h[4, 1, 1]
@@ -190,14 +190,14 @@ class InducedTrivialCharacterBasis(Character_generic):
         3*s[1] - 2*s[1, 1] - 2*s[2] + s[2, 1]
         sage: st(s[2,1])
         st[] + 3*st[1] + 2*st[1, 1] + 2*st[2] + st[2, 1]
-        sage: st[2]*st[1]
+        sage: st[2]*st[1]                                                               # needs lrcalc_python
         st[1] + st[1, 1] + st[2] + st[2, 1] + st[3]
         sage: s[4,2].kronecker_product(s[5,1])
         s[3, 2, 1] + s[3, 3] + s[4, 1, 1] + s[4, 2] + s[5, 1]
 
     TESTS::
 
-        sage: TestSuite(ht).run()
+        sage: TestSuite(ht).run()                                                       # needs lrcalc_python
     """
 
     def __init__(self, Sym):
@@ -399,20 +399,20 @@ class IrreducibleCharacterBasis(Character_generic):
         3*s[1] - 2*s[1, 1] - 2*s[2] + s[2, 1]
         sage: st(s[2,1])
         st[] + 3*st[1] + 2*st[1, 1] + 2*st[2] + st[2, 1]
-        sage: st[2]*st[1]
+        sage: st[2]*st[1]                                                               # needs lrcalc_python
         st[1] + st[1, 1] + st[2] + st[2, 1] + st[3]
         sage: s[4,2].kronecker_product(s[5,1])
         s[3, 2, 1] + s[3, 3] + s[4, 1, 1] + s[4, 2] + s[5, 1]
         sage: st[1,1,1].counit()
         -1
-        sage: all(sum(c*st(la)*st(mu).antipode() for
+        sage: all(sum(c*st(la)*st(mu).antipode() for                                    # needs lrcalc_python
         ....:    ((la,mu),c) in st(ga).coproduct())==st(st(ga).counit())
         ....:    for ga in Partitions(3))
         True
 
     TESTS::
 
-        sage: TestSuite(st).run()
+        sage: TestSuite(st).run()                                                       # needs lrcalc_python
     """
 
     def __init__(self, Sym):

sage/combinat/sf/classical.py

@@ -79,7 +79,7 @@ class SymmetricFunctionAlgebra_classical(sfa.SymmetricFunctionAlgebra_generic):
 
     TESTS::
 
-        sage: # needs lrcalc
+        sage: # needs lrcalc_python
         sage: TestSuite(SymmetricFunctions(QQ).s()).run()
         sage: TestSuite(SymmetricFunctions(QQ).h()).run()
         sage: TestSuite(SymmetricFunctions(QQ).m()).run()