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

sage/combinat/sf/sf.py

@@ -387,8 +387,8 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     information::
 
         sage: s = SymmetricFunctions(QQ).schur()
-        sage: f = s[2]^2
-        sage: f.inner_plethysm(s[2])
+        sage: f = s[2]^2                                                                # needs lrcalc_python
+        sage: f.inner_plethysm(s[2])                                                    # needs lrcalc_python
         s[2]
 
     .. rubric:: Hopf algebra structure
@@ -430,6 +430,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
     Here are further examples::
 
+        sage: # needs lrcalc_python
         sage: f = s[2]^2
         sage: f.antipode()
         s[1, 1, 1, 1] + s[2, 1, 1] + s[2, 2]
@@ -609,18 +610,18 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
         sage: Sym = SymmetricFunctions(QQ)
         sage: ks = Sym.kschur(3,1)
-        sage: f = ks[2,1]*ks[2,1]; f
+        sage: f = ks[2,1]*ks[2,1]; f                                                    # needs lrcalc_python
         ks3[2, 2, 1, 1] + ks3[2, 2, 2] + ks3[3, 1, 1, 1]
 
     or to lift to the ring of symmetric functions::
 
-        sage: f.lift()
+        sage: f.lift()                                                                  # needs lrcalc_python
         s[2, 2, 1, 1] + s[2, 2, 2] + s[3, 1, 1, 1] + 2*s[3, 2, 1] + s[3, 3] + s[4, 1, 1] + s[4, 2]
 
     However, it is not always possible to convert a symmetric function to the `k`-bounded subspace::
 
         sage: s = Sym.schur()
-        sage: ks(s[2,1,1])
+        sage: ks(s[2,1,1])                                                              # needs lrcalc_python
         Traceback (most recent call last):
         ...
         ValueError: s[2, 1, 1] is not in the image
@@ -641,6 +642,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     function and an `\ell`-Schur function is in the linear span of the `k+\ell`-Schur
     functions::
 
+        sage: # needs lrcalc_python
         sage: ks(ks[2,1]*ks[1,1])
         Traceback (most recent call last):
         ...
@@ -658,6 +660,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     `k`-split basis conjecturally expands positively in the `k`-Schur functions.
     The definition can be found in [LLMSSZ]_ p. 81.::
 
+        sage: # needs lrcalc_python
         sage: ksp3 = SymS3.ksplit()
         sage: ksp3(Qp[2,1,1,1])
         ksp3[2, 1, 1, 1] + t^2*ksp3[2, 2, 1] + (t^3+t^2)*ksp3[3, 1, 1] + t^4*ksp3[3, 2]
@@ -671,6 +674,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     the ideal is generated by the monomial symmetric functions indexed by partitions
     whose first part is greater than `k`.::
 
+        sage: # needs lrcalc_python
         sage: Sym = SymmetricFunctions(QQ)
         sage: SymQ3 = Sym.kBoundedQuotient(3,t=1)
         sage: km = SymQ3.kmonomial()
@@ -686,6 +690,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     the Hall-Littlewood symmetric functions in the P basis indexed by partitions with
     first part greater than `k`.::
 
+        sage: # needs lrcalc_python
         sage: Sym = SymmetricFunctions(FractionField(QQ['t']))
         sage: SymQ3 = Sym.kBoundedQuotient(3)
         sage: kHLP = SymQ3.kHallLittlewoodP()
@@ -702,6 +707,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     expands positively in the `k`-bounded Hall-Littlewood functions and has positive
     structure coefficients.::
 
+        sage: # needs lrcalc_python
         sage: dks = SymQ3.dual_k_Schur()
         sage: kHLP(dks[2,2])
         (t^4+t^2)*HLP3[1, 1, 1, 1] + t*HLP3[2, 1, 1] + HLP3[2, 2]
@@ -718,7 +724,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
         sage: SymQ3 = Sym.kBoundedQuotient(3,t=1)
         sage: dks = SymQ3.dual_k_Schur()
         sage: F = SymQ3.affineSchur()
-        sage: F[3,1]==dks[3,1]
+        sage: F[3,1]==dks[3,1]                                                          # needs lrcalc_python
         True
 
     .. rubric:: Implementing new bases
@@ -778,6 +784,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
     Macdonald ``J`` basis are the coefficients `K_{\lambda\mu}(q,t)`.
     Here is an example of its use::
 
+        sage: # needs lrcalc_python
         sage: QQqt = QQ['q','t'].fraction_field()
         sage: (q,t) = QQqt.gens()
         sage: st = SFA_st(SymmetricFunctions(QQqt),t)
@@ -866,7 +873,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
             sage: Sym1 = SymmetricFunctions(FiniteField(23))
             sage: Sym2 = SymmetricFunctions(Integers(23))
-            sage: TestSuite(Sym).run()
+            sage: TestSuite(Sym).run()                                                  # needs lrcalc_python
         """
         # change the line below to assert(R in Rings()) once MRO issues from #15536, #15475 are resolved
         assert R in Fields() or R in Rings()  # side effect of this statement assures MRO exists for R
@@ -1181,7 +1188,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: SymmetricFunctions(QQ).symplectic()
+            sage: SymmetricFunctions(QQ).symplectic()                                   # needs lrcalc_python
             Symmetric Functions over Rational Field in the symplectic basis
         """
         from . import symplectic
@@ -1196,7 +1203,7 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: SymmetricFunctions(QQ).orthogonal()
+            sage: SymmetricFunctions(QQ).orthogonal()                                   # needs lrcalc_python
             Symmetric Functions over Rational Field in the orthogonal basis
         """
         from . import orthogonal
@@ -1524,14 +1531,14 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
             sage: Sym = SymmetricFunctions(QQ)
             sage: ks = Sym.kschur(3,1)
-            sage: ks[2]*ks[2]
+            sage: ks[2]*ks[2]                                                           # needs lrcalc_python
             ks3[2, 2] + ks3[3, 1]
-            sage: ks[2,1,1].lift()
+            sage: ks[2,1,1].lift()                                                      # needs lrcalc_python
             s[2, 1, 1] + s[3, 1]
 
             sage: Sym = SymmetricFunctions(QQ['t'])
             sage: ks = Sym.kschur(3)
-            sage: ks[2,2,1].lift()
+            sage: ks[2,2,1].lift()                                                      # needs lrcalc_python
             s[2, 2, 1] + t*s[3, 2]
         """
         return self.kBoundedSubspace(k, t=t).kschur()
@@ -1544,14 +1551,14 @@ class SymmetricFunctions(UniqueRepresentation, Parent):
 
             sage: Sym = SymmetricFunctions(QQ)
             sage: ksp = Sym.ksplit(3,1)
-            sage: ksp[2]*ksp[2]
+            sage: ksp[2]*ksp[2]                                                         # needs lrcalc_python
             ksp3[2, 2] + ksp3[3, 1]
-            sage: ksp[2,1,1].lift()
+            sage: ksp[2,1,1].lift()                                                     # needs lrcalc_python
             s[2, 1, 1] + s[2, 2] + s[3, 1]
 
             sage: Sym = SymmetricFunctions(QQ['t'])
             sage: ksp = Sym.ksplit(3)
-            sage: ksp[2,1,1].lift()
+            sage: ksp[2,1,1].lift()                                                     # needs lrcalc_python
             s[2, 1, 1] + t*s[2, 2] + t*s[3, 1]
         """
         return self.kBoundedSubspace(k, t=t).ksplit()

sage/combinat/sf/symplectic.py

@@ -1,5 +1,5 @@
 # sage_setup: distribution = sagemath-combinat
-# sage.doctest: needs sage.combinat sage.modules
+# sage.doctest: needs lrcalc_python sage.combinat sage.modules
 """
 Symplectic symmetric functions
 

sage/combinat/skew_partition.py

@@ -1287,7 +1287,7 @@ class SkewPartition(CombinatorialElement):
         We verify that the Frobenius image is the corresponding
         skew Schur function::
 
-            sage: s[3,2,1].skew_by(s[2])                                                # needs sage.modules
+            sage: s[3,2,1].skew_by(s[2])                                                # needs lrcalc_python sage.modules
             s[2, 1, 1] + s[2, 2] + s[3, 1]
 
         ::
@@ -1296,7 +1296,7 @@ class SkewPartition(CombinatorialElement):
             sage: SM = mu.specht_module(QQ)                                             # needs sage.modules
             sage: s(SM.frobenius_image())                                               # needs sage.libs.flint sage.modules
             s[2, 1, 1] + s[2, 2] + 2*s[3, 1] + s[4]
-            sage: s(mu)                                                                 # needs sage.modules
+            sage: s(mu)                                                                 # needs lrcalc_python sage.modules
             s[2, 1, 1] + s[2, 2] + 2*s[3, 1] + s[4]
         """
         from sage.combinat.specht_module import SpechtModule

sage/combinat/sloane_functions.py

@@ -3214,6 +3214,7 @@ class A000720(SloaneSequence):
 
         EXAMPLES::
 
+            sage: # needs sage.symbolic
             sage: a = sloane.A000720;a
             pi(n), the number of primes <= n. Sometimes called PrimePi(n)
             sage: a(0)
@@ -3248,7 +3249,7 @@ class A000720(SloaneSequence):
         """
         EXAMPLES::
 
-            sage: [sloane.A000720._eval(n) for n in range(1,11)]
+            sage: [sloane.A000720._eval(n) for n in range(1,11)]                        # needs sage.symbolic
             [0, 1, 2, 2, 3, 3, 4, 4, 4, 4]
         """
         return prime_pi(n)
@@ -3269,7 +3270,8 @@ class A064553(SloaneSequence):
 
         EXAMPLES::
 
-            sage: a = sloane.A064553;a
+            sage: # needs sage.symbolic
+            sage: a = sloane.A064553; a
             a(1) = 1, a(prime(i)) = i+1 for i > 0 and a(u*v) = a(u)*a(v) for u,v > 0
             sage: a(0)
             Traceback (most recent call last):
@@ -3303,7 +3305,7 @@ class A064553(SloaneSequence):
         """
         EXAMPLES::
 
-            sage: [sloane.A064553._eval(n) for n in range(1,11)]
+            sage: [sloane.A064553._eval(n) for n in range(1,11)]                        # needs sage.symbolic
             [1, 2, 3, 4, 4, 6, 5, 8, 9, 8]
         """
         return prod([(prime_pi(p)+1)**e for p, e in arith.factor(n)])

sage/combinat/species/cycle_species.py

@@ -194,7 +194,7 @@ class CycleSpecies(GenericCombinatorialSpecies, UniqueRepresentation):
             sage: P = species.CycleSpecies()
             sage: g = P.generating_series(RR)
             sage: g[0:3]
-            [0.000000000000000, 1.00000000000000, 0.500000000000000]
+            [0.0..., 1.0..., 0.5...]
         """
         if n:
             return self._weight * base_ring.one() / n
@@ -229,7 +229,7 @@ class CycleSpecies(GenericCombinatorialSpecies, UniqueRepresentation):
             sage: P = species.CycleSpecies()
             sage: g = P.isotype_generating_series(RR)
             sage: g[0:3]
-            [0.000000000000000, 1.00000000000000, 1.00000000000000]
+            [0.0..., 1.0..., 1.0...]
         """
         if n:
             return self._weight * base_ring.one()

sage/combinat/symmetric_group_algebra.py

@@ -120,7 +120,7 @@ def SymmetricGroupAlgebra(R, W, category=None):
         Weyl Group of type ['A', 3] (as a matrix group acting
         on the ambient space)
         sage: SGA.an_element()
-        s1*s2*s3 + 3*s2*s3*s1*s2 + 2*s3*s1 + 1
+        s1*s2*s3 + ... + 1
 
     The preferred way to construct the symmetric group algebra is to
     go through the usual ``algebra`` method::

sage/combinat/symmetric_group_representations.py

@@ -136,9 +136,12 @@ def SymmetricGroupRepresentation(partition, implementation='specht',
 
     The unitary representation::
 
-        sage: unitary = SymmetricGroupRepresentation([3,1], "unitary"); unitary
+        sage: unitary = SymmetricGroupRepresentation([3,1], "unitary"); unitary         # needs sage.symbolic
         Unitary representation of the symmetric group corresponding to [3, 1]
-        sage: unitary_GF49 = SymmetricGroupRepresentation([3,1], "unitary", ring=GF(7**2)); unitary_GF49
+
+        sage: # needs sage.rings.finite_rings
+        sage: unitary_GF49 = SymmetricGroupRepresentation([3,1], "unitary", ring=GF(7**2))
+        sage: unitary_GF49
         Unitary representation of the symmetric group corresponding to [3, 1]
         sage: unitary_GF49([2,1,3,4])
         [6 0 0]
@@ -263,8 +266,10 @@ def SymmetricGroupRepresentations(n, implementation='specht', ring=None,
 
     ::
 
-        sage: unitary = SymmetricGroupRepresentations(3, "unitary"); unitary
+        sage: unitary = SymmetricGroupRepresentations(3, "unitary"); unitary            # needs sage.symbolic
         Unitary representations of the symmetric group of order 3! over Symbolic Ring
+
+        sage: # needs sage.rings.finite_rings
         sage: unitary_GF49 = SymmetricGroupRepresentations(4, "unitary", ring=GF(7**2)); unitary_GF49
         Unitary representations of the symmetric group of order 4! over Finite Field in z2 of size 7^2
         sage: unitary_GF49([3,1])([2,1,3,4])
@@ -1059,12 +1064,16 @@ class UnitaryRepresentation(SymmetricGroupRepresentation_generic_class):
 
         EXAMPLES::
 
+            sage: # needs sage.symbolic
             sage: U = SymmetricGroupRepresentation([2,1], "unitary")
             sage: TestSuite(U).run()
+
             sage: U = SymmetricGroupRepresentation([2,1], "unitary", GF(7))
             Traceback (most recent call last):
             ...
             ValueError: the base ring must be a finite field of square order
+
+            sage: # needs sage.rings.finite_rings
             sage: U = SymmetricGroupRepresentation([2,1], "unitary", GF(7**2))
             sage: TestSuite(U).run()
         """
@@ -1090,7 +1099,7 @@ class UnitaryRepresentation(SymmetricGroupRepresentation_generic_class):
 
         EXAMPLES::
 
-            sage: SymmetricGroupRepresentation([2,1], "unitary")
+            sage: SymmetricGroupRepresentation([2,1], "unitary")                        # needs sage.symbolic
             Unitary representation of the symmetric group corresponding to [2, 1]
         """
         return f"Unitary representation of the symmetric group corresponding to {self._partition}"
@@ -1107,6 +1116,7 @@ class UnitaryRepresentation(SymmetricGroupRepresentation_generic_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.finite_rings
             sage: unitary_specht = SymmetricGroupRepresentation([3,1], 'unitary', ring=GF(7**2))
             sage: unitary_specht.representation_matrix(Permutation([2,1,3,4]))
             [6 0 0]
@@ -1138,6 +1148,7 @@ class UnitaryRepresentation(SymmetricGroupRepresentation_generic_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.finite_rings
             sage: unitary_specht = SymmetricGroupRepresentation([3,1], 'unitary', ring=GF(7**2))
             sage: unitary_specht._unitary_change_basis_matrix
             [       1        4        4]
@@ -1196,6 +1207,7 @@ class UnitaryRepresentation(SymmetricGroupRepresentation_generic_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.finite_rings
             sage: unitary_specht = SymmetricGroupRepresentation([2,2], 'unitary', ring=GF(7**2))
             sage: unitary_specht._representation_matrix_uncached(Permutation([3,1,4,2]))
             [       4 5*z2 + 4]

sage/combinat/tableau.py

@@ -7348,7 +7348,7 @@ class RowStandardTableaux_size(RowStandardTableaux, DisjointUnionEnumeratedSets)
 
     TESTS::
 
-        sage: TestSuite(RowStandardTableaux(4)).run()                                   # needs sage.graphs
+        sage: TestSuite(RowStandardTableaux(4)).run()                                   # needs sage.graphs sage.libs.flint
 
         sage: RowStandardTableaux(3).cardinality()                                      # needs sage.libs.flint
         10

sage/combinat/tiling.py

@@ -313,36 +313,36 @@ def ncube_isometry_group(n, orientation_preserving=True):
     EXAMPLES::
 
         sage: from sage.combinat.tiling import ncube_isometry_group
-        sage: ncube_isometry_group(2)
+        sage: sorted(ncube_isometry_group(2))
         [
-        [1 0]  [ 0  1]  [-1  0]  [ 0 -1]
-        [0 1], [-1  0], [ 0 -1], [ 1  0]
+        [-1  0]  [ 0 -1]  [ 0  1]  [1 0]
+        [ 0 -1], [ 1  0], [-1  0], [0 1]
         ]
-        sage: ncube_isometry_group(2, orientation_preserving=False)
+        sage: sorted(ncube_isometry_group(2, orientation_preserving=False))
         [
-        [1 0]  [ 0 -1]  [ 1  0]  [ 0  1]  [0 1]  [-1  0]  [ 0 -1]  [-1  0]
-        [0 1], [-1  0], [ 0 -1], [-1  0], [1 0], [ 0 -1], [ 1  0], [ 0  1]
+        [-1  0]  [-1  0]  [ 0 -1]  [ 0 -1]  [ 0  1]  [0 1]  [ 1  0]  [1 0]
+        [ 0 -1], [ 0  1], [-1  0], [ 1  0], [-1  0], [1 0], [ 0 -1], [0 1]
         ]
 
     There are 24 orientation preserving isometries of the 3-cube::
 
-        sage: ncube_isometry_group(3)
+        sage: sorted(ncube_isometry_group(3))
         [
-        [1 0 0]  [ 1  0  0]  [ 1  0  0]  [ 0  1  0]  [0 1 0]  [ 0  0  1]
-        [0 1 0]  [ 0  0  1]  [ 0  0 -1]  [-1  0  0]  [0 0 1]  [ 0 -1  0]
-        [0 0 1], [ 0 -1  0], [ 0  1  0], [ 0  0  1], [1 0 0], [ 1  0  0],
+        [-1  0  0]  [-1  0  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0 -1  0]
+        [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [ 0  1  0]  [-1  0  0]  [ 0  0 -1]
+        [ 0  0  1], [ 0 -1  0], [ 0  1  0], [ 0  0 -1], [ 0  0 -1], [ 1  0  0],
         <BLANKLINE>
-        [-1  0  0]  [ 0 -1  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0  0 -1]
-        [ 0 -1  0]  [ 0  0 -1]  [ 0  0 -1]  [ 0  1  0]  [ 0  0  1]  [ 1  0  0]
-        [ 0  0  1], [ 1  0  0], [ 0 -1  0], [ 0  0 -1], [-1  0  0], [ 0 -1  0],
+        [ 0 -1  0]  [ 0 -1  0]  [ 0  0 -1]  [ 0  0 -1]  [ 0  0 -1]  [ 0  0 -1]
+        [ 0  0  1]  [ 1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0  1  0]  [ 1  0  0]
+        [-1  0  0], [ 0  0  1], [ 0  1  0], [-1  0  0], [ 1  0  0], [ 0 -1  0],
         <BLANKLINE>
-        [ 0  1  0]  [ 0  0  1]  [0 0 1]  [ 0 -1  0]  [ 0  0 -1]  [-1  0  0]
-        [ 1  0  0]  [ 0  1  0]  [1 0 0]  [ 1  0  0]  [ 0  1  0]  [ 0  0  1]
-        [ 0  0 -1], [-1  0  0], [0 1 0], [ 0  0  1], [ 1  0  0], [ 0  1  0],
+        [ 0  0  1]  [ 0  0  1]  [ 0  0  1]  [0 0 1]  [ 0  1  0]  [ 0  1  0]
+        [-1  0  0]  [ 0 -1  0]  [ 0  1  0]  [1 0 0]  [-1  0  0]  [ 0  0 -1]
+        [ 0 -1  0], [ 1  0  0], [-1  0  0], [0 1 0], [ 0  0  1], [-1  0  0],
         <BLANKLINE>
-        [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [ 1  0  0]  [ 0  0 -1]  [ 0  1  0]
-        [-1  0  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0 -1  0]  [ 0  0 -1]
-        [ 0  0 -1], [ 0  1  0], [ 0 -1  0], [ 0  0 -1], [-1  0  0], [-1  0  0]
+        [0 1 0]  [ 0  1  0]  [ 1  0  0]  [ 1  0  0]  [ 1  0  0]  [1 0 0]
+        [0 0 1]  [ 1  0  0]  [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [0 1 0]
+        [1 0 0], [ 0  0 -1], [ 0  0 -1], [ 0  1  0], [ 0 -1  0], [0 0 1]
         ]
 
     TESTS::

sage/combinat/triangles_FHM.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-combinat
+# sage.doctest: known bug: windows (hangs)
 """
 Combinatorial triangles for posets and fans
 

sage/combinat/tutorial.py

@@ -850,7 +850,7 @@ Partial orders on a set of `8` elements, up to isomorphism::
 
 ::
 
-    sage: C.unrank(20).plot()                                                           # needs sage.plot
+    sage: C.unrank(20).plot()                                                           # needs nauty sage.plot
     Graphics object consisting of ... graphics primitives
 
 .. image:: ../../media/a_poset.png
@@ -858,7 +858,7 @@ Partial orders on a set of `8` elements, up to isomorphism::
 One can iterate through all graphs up to isomorphism. For example,
 there are 34 simple graphs with 5 vertices::
 
-    sage: len(list(graphs(5)))
+    sage: len(list(graphs(5)))                                                          # needs nauty
     34
 
 Here are those with at most `4` edges::
@@ -1623,7 +1623,7 @@ iterator or non-naive counting::
 
     sage: A = random_matrix(ZZ, 6, 3, x=7)
     sage: L = LatticePolytope(A.rows())
-    sage: L.points()                               # random
+    sage: L.points()                               # random                             # needs palp
     M(4, 1, 0),
     M(0, 3, 5),
     M(2, 2, 3),
@@ -1636,7 +1636,7 @@ iterator or non-naive counting::
     M(4, 2, 3),
     M(5, 2, 3)
     in 3-d lattice M
-    sage: L.npoints()                                 # random
+    sage: L.npoints()                                 # random                          # needs palp
     11
 
 This polytope can be visualized in 3D with ``L.plot3d()`` (see
@@ -1820,7 +1820,7 @@ graph; so planar graphs form a subtree of the previous tree. To generate
 them, exactly the same algorithm can be used,
 selecting only the children which are planar::
 
-    sage: [len(list(graphs(n, property=lambda G: G.is_planar())))
+    sage: [len(list(graphs(n, property=lambda G: G.is_planar())))       # needs planarity
     ....:  for n in range(7)]
     [1, 1, 2, 4, 11, 33, 142]
 

sage/combinat/words/finite_word.py

@@ -1657,13 +1657,14 @@ class FiniteWord_class(Word_class):
 
         For ultimately periodic words::
 
+            sage: # needs sage.graphs sage.modules
             sage: sigma = WordMorphism('a->abcd,b->cd,c->cd,d->cd')
-            sage: w = sigma.fixed_point('a')[:100]; w                                   # needs sage.modules
+            sage: w = sigma.fixed_point('a')[:100]; w
             word: abcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcd...
-            sage: g = w.reduced_rauzy_graph(5)                                          # needs sage.graphs
-            sage: g.vertices(sort=True)                                                 # needs sage.graphs
+            sage: g = w.reduced_rauzy_graph(5)
+            sage: g.vertices(sort=True)
             [word: abcdc, word: cdcdc]
-            sage: g.edges(sort=True)                                                    # needs sage.graphs
+            sage: g.edges(sort=True)
             [(word: abcdc, word: cdcdc, word: dc), (word: cdcdc, word: cdcdc, word: dc)]
 
         AUTHOR:

sage/combinat/words/word.py

@@ -519,10 +519,12 @@ class InfiniteWord_iter_with_caching(WordDatatype_iter_with_caching, InfiniteWor
 
     Pickle is not supported for infinite word defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -558,10 +560,12 @@ class InfiniteWord_iter(WordDatatype_iter, InfiniteWord_class):
 
     Pickle is not supported for infinite word defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -660,10 +664,12 @@ class Word_iter_with_caching(WordDatatype_iter_with_caching, Word_class):
 
     Pickle is not supported for word of unknown length defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -697,10 +703,12 @@ class Word_iter(WordDatatype_iter, Word_class):
 
     Pickle is not supported for word of unknown length defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        TypeError raised in dumps() as expected
     """
     pass
 

sage/combinat/words/word_generators.py

@@ -809,7 +809,7 @@ class WordGenerator:
 
             sage: from itertools import cycle, chain
             sage: it = chain([0], cycle([2, 1]))
-            sage: words.CharacteristicSturmianWord(it)
+            sage: words.CharacteristicSturmianWord(it)                                  # needs sage.rings.real_mpfr
             word: 0100100101001001001010010010010100100101...
 
         The first terms of the standard sequence of the characteristic

sage/databases/findstat.py

@@ -4006,7 +4006,7 @@ def _finite_lattices(n):
     TESTS::
 
         sage: from sage.databases.findstat import _finite_lattices
-        sage: sorted((L.cover_relations() for L in _finite_lattices(4)),
+        sage: sorted((L.cover_relations() for L in _finite_lattices(4)),        # needs nauty
         ....:        key=len)
         [[['bottom', 0], [0, 1], [1, 'top']],
          [['bottom', 0], ['bottom', 1], [0, 'top'], [1, 'top']]]

sage/libs/symmetrica/symmetrica.pxi

@@ -527,6 +527,7 @@ def test_integer(object x):
 
     EXAMPLES::
 
+        sage: import sage.libs.symmetrica.all
         sage: from sage.libs.symmetrica.symmetrica import test_integer
         sage: test_integer(1)
         1

sage/monoids/string_monoid.py

@@ -503,6 +503,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
     EXAMPLES::
 
+        sage: # needs sage.rings.real_mpfr
         sage: S = AlphabeticStrings(); S
         Free alphabetic string monoid on A-Z
         sage: S.gen(0)
@@ -519,6 +520,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.real_mpfr
             sage: S = AlphabeticStrings(); S
             Free alphabetic string monoid on A-Z
             sage: S.gen(0)
@@ -577,6 +579,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.real_mpfr
             sage: S = AlphabeticStrings()
             sage: S.gen(0)
             A
@@ -654,6 +657,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
         The characteristic frequency probability distribution table of
         Beker and Piper [BP1982]_::
 
+            sage: # needs sage.rings.real_mpfr
             sage: A = AlphabeticStrings()
             sage: table = A.characteristic_frequency(table_name='beker_piper')
             sage: sorted(table.items())
@@ -688,6 +692,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
         The characteristic frequency probability distribution table
         of Lewand [Lew2000]_::
 
+            sage: # needs sage.rings.real_mpfr
             sage: table = A.characteristic_frequency(table_name='lewand')
             sage: sorted(table.items())
             <BLANKLINE>
@@ -721,6 +726,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
         Illustrating the difference between :func:`characteristic_frequency`
         and :func:`frequency_distribution() <sage.monoids.string_monoid_element.StringMonoidElement.frequency_distribution>`::
 
+            sage: # needs sage.rings.real_mpfr
             sage: A = AlphabeticStrings()
             sage: M = A.encoding("abcd")
             sage: FD = M.frequency_distribution().function()
@@ -764,6 +770,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
         The table name must be either "beker_piper" or "lewand"::
 
+            sage: # needs sage.rings.real_mpfr
             sage: table = A.characteristic_frequency(table_name="")
             Traceback (most recent call last):
             ...
@@ -797,6 +804,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
         EXAMPLES::
 
+            sage: # needs sage.rings.real_mpfr
             sage: S = AlphabeticStrings()
             sage: s = S.encoding("The cat in the hat."); s
             THECATINTHEHAT