sage.graphs, sage.combinat.{designs,posets}, sage.sandpiles: Update # needs

src/sage/combinat/affine_permutation.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.groups
 r"""
 Affine Permutations
 """

src/sage/combinat/alternating_sign_matrix.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Alternating Sign Matrices
 

src/sage/combinat/bijectionist.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.numerical.mip
 r"""
 A bijectionist's toolkit
 

src/sage/combinat/binary_recurrence_sequences.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Binary Recurrence Sequences
 

src/sage/combinat/blob_algebra.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Blob Algebras
 

src/sage/combinat/chas/fsym.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Poirier-Reutenauer Hopf algebra of standard tableaux
 

src/sage/combinat/chas/wqsym.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Word Quasi-symmetric functions
 

src/sage/combinat/cluster_complex.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.graphs
 r"""
 Cluster complex (or generalized dual associahedron)
 

src/sage/combinat/constellation.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.groups
 r"""
 Constellations
 

src/sage/combinat/crystals/affine.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Affine Crystals
 """

src/sage/combinat/crystals/affine_factorization.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Affine factorization crystal of type `A`
 """

src/sage/combinat/crystals/affinization.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Affinization Crystals
 """

src/sage/combinat/crystals/alcove_path.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Alcove paths
 

src/sage/combinat/crystals/bkk_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Benkart-Kang-Kashiwara crystals for the general-linear Lie superalgebra
 """

src/sage/combinat/crystals/crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 An introduction to crystals
 ===========================

src/sage/combinat/crystals/direct_sum.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Direct Sum of Crystals
 """

src/sage/combinat/crystals/elementary_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Elementary Crystals
 

src/sage/combinat/crystals/fast_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Fast Rank Two Crystals
 """

src/sage/combinat/crystals/fully_commutative_stable_grothendieck.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Fully commutative stable Grothendieck crystal
 

src/sage/combinat/crystals/generalized_young_walls.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Crystals of Generalized Young Walls
 

src/sage/combinat/crystals/highest_weight_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Highest weight crystals
 """

src/sage/combinat/crystals/induced_structure.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Induced Crystals
 

src/sage/combinat/crystals/infinity_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 `\mathcal{B}(\infty)` Crystals of Tableaux in Nonexceptional Types and `G_2`
 

src/sage/combinat/crystals/kac_modules.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Crystals of Kac modules of the general-linear Lie superalgebra
 """

src/sage/combinat/crystals/kirillov_reshetikhin.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Kirillov-Reshetikhin Crystals
 """

src/sage/combinat/crystals/kyoto_path_model.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Kyoto Path Model for Affine Highest Weight Crystals
 """

src/sage/combinat/crystals/letters.pyx

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Crystals of letters
 """

src/sage/combinat/crystals/littelmann_path.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Littelmann paths
 

src/sage/combinat/crystals/monomial_crystals.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Crystals of Modified Nakajima Monomials
 

src/sage/combinat/crystals/multisegments.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Crystal of Bernstein-Zelevinsky Multisegments
 """

src/sage/combinat/crystals/mv_polytopes.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Crystal Of Mirković-Vilonen (MV) Polytopes
 

src/sage/combinat/crystals/pbw_crystal.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 `\mathcal{B}(\infty)` Crystal Of PBW Monomials
 

src/sage/combinat/crystals/pbw_datum.pyx

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 PBW Data
 

src/sage/combinat/crystals/polyhedral_realization.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Polyhedral Realization of `B(\infty)`
 """

src/sage/combinat/crystals/spins.pyx

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Spin Crystals
 

src/sage/combinat/crystals/star_crystal.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Star-Crystal Structure On `B(\infty)`
 

src/sage/combinat/crystals/subcrystal.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Subcrystals
 

src/sage/combinat/crystals/tensor_product.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Tensor Products of Crystals
 

src/sage/combinat/crystals/tensor_product_element.pyx

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: needs sage.combinat sage.modules
 """
 Tensor Products of Crystal Elements
 

src/sage/combinat/crystals/virtual_crystal.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 Virtual Crystals
 

src/sage/combinat/descent_algebra.py

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.combinat sage.modules
 """
 Descent Algebras
 

src/sage/combinat/designs/bibd.py

@@ -236,7 +236,7 @@ def balanced_incomplete_block_design(v, k, lambd=1, existence=False, use_LJCR=Fa
         (10,4,2)-Balanced Incomplete Block Design
         sage: designs.balanced_incomplete_block_design(50,25,24)                        # needs sage.schemes
         (50,25,24)-Balanced Incomplete Block Design
-        sage: designs.balanced_incomplete_block_design(29,15,15)                        # needs sage.libs.pari
+        sage: designs.balanced_incomplete_block_design(29,15,15)                        # needs sage.libs.pari sage.schemes
         (29,15,15)-Balanced Incomplete Block Design
     """
     # Trivial BIBD
@@ -1125,7 +1125,7 @@ def v_5_1_BIBD(v, check=True):
 
         sage: from sage.combinat.designs.bibd import v_5_1_BIBD
         sage: i = 0
-        sage: while i<200:                                                              # needs sage.libs.pari
+        sage: while i<200:                                                              # needs sage.libs.pari sage.schemes
         ....:    i += 20
         ....:    _ = v_5_1_BIBD(i+1)
         ....:    _ = v_5_1_BIBD(i+5)

src/sage/combinat/designs/block_design.py

@@ -122,8 +122,8 @@ def are_hyperplanes_in_projective_geometry_parameters(v, k, lmbda, return_parame
         sage: are_hyperplanes_in_projective_geometry_parameters(40, 13, 4,
         ....:                                                   return_parameters=True)
         (True, (3, 3))
-        sage: PG = designs.ProjectiveGeometryDesign(3, 2, GF(3))
-        sage: PG.is_t_design(return_parameters=True)
+        sage: PG = designs.ProjectiveGeometryDesign(3, 2, GF(3))                        # needs sage.combinat
+        sage: PG.is_t_design(return_parameters=True)                                    # needs sage.combinat
         (True, (2, 40, 13, 4))
 
         sage: are_hyperplanes_in_projective_geometry_parameters(15, 3, 1)
@@ -217,13 +217,13 @@ def ProjectiveGeometryDesign(n, d, F, algorithm=None, point_coordinates=True, ch
     The set of `d`-dimensional subspaces in a `n`-dimensional projective space
     forms `2`-designs (or balanced incomplete block designs)::
 
-        sage: PG = designs.ProjectiveGeometryDesign(4, 2, GF(2)); PG
+        sage: PG = designs.ProjectiveGeometryDesign(4, 2, GF(2)); PG                    # needs sage.combinat
         Incidence structure with 31 points and 155 blocks
-        sage: PG.is_t_design(return_parameters=True)
+        sage: PG.is_t_design(return_parameters=True)                                    # needs sage.combinat
         (True, (2, 31, 7, 7))
 
-        sage: PG = designs.ProjectiveGeometryDesign(3, 1, GF(4))
-        sage: PG.is_t_design(return_parameters=True)
+        sage: PG = designs.ProjectiveGeometryDesign(3, 1, GF(4))                        # needs sage.combinat
+        sage: PG.is_t_design(return_parameters=True)                                    # needs sage.combinat
         (True, (2, 85, 5, 1))
 
     Check with ``F`` being a prime power::
@@ -707,6 +707,7 @@ def projective_plane(n, check=True, existence=False):
 
     EXAMPLES::
 
+        sage: # needs sage.schemes
         sage: designs.projective_plane(2)
         (7,3,1)-Balanced Incomplete Block Design
         sage: designs.projective_plane(3)
@@ -737,6 +738,7 @@ def projective_plane(n, check=True, existence=False):
 
     TESTS::
 
+        sage: # needs sage.schemes
         sage: designs.projective_plane(2197, existence=True)
         True
         sage: designs.projective_plane(6, existence=True)
@@ -816,6 +818,7 @@ def AffineGeometryDesign(n, d, F, point_coordinates=True, check=True):
 
     EXAMPLES::
 
+        sage: # needs sage.combinat
         sage: BD = designs.AffineGeometryDesign(3, 1, GF(2))
         sage: BD.is_t_design(return_parameters=True)
         (True, (2, 8, 2, 1))
@@ -934,12 +937,13 @@ def WittDesign(n):
 
     EXAMPLES::
 
-        sage: BD = designs.WittDesign(9)                # optional - gap_package_design
-        sage: BD.is_t_design(return_parameters=True)    # optional - gap_package_design
+        sage: # optional - gap_package_design
+        sage: BD = designs.WittDesign(9)
+        sage: BD.is_t_design(return_parameters=True)
         (True, (2, 9, 3, 1))
-        sage: BD                                        # optional - gap_package_design
+        sage: BD
         Incidence structure with 9 points and 12 blocks
-        sage: print(BD)                                 # optional - gap_package_design
+        sage: print(BD)
         Incidence structure with 9 points and 12 blocks
     """
     libgap.load_package("design")
@@ -957,16 +961,18 @@ def HadamardDesign(n):
 
     EXAMPLES::
 
-        sage: designs.HadamardDesign(7)                                                 # needs sage.modules
+        sage: # needs sage.combinat sage.modules
+        sage: designs.HadamardDesign(7)
         Incidence structure with 7 points and 7 blocks
-        sage: print(designs.HadamardDesign(7))                                          # needs sage.modules
+        sage: print(designs.HadamardDesign(7))
         Incidence structure with 7 points and 7 blocks
 
     For example, the Hadamard 2-design with `n = 11` is a design whose parameters are `2-(11, 5, 2)`.
     We verify that `NJ = 5J` for this design. ::
 
-        sage: D = designs.HadamardDesign(11); N = D.incidence_matrix()                  # needs sage.modules
-        sage: J = matrix(ZZ, 11, 11, [1]*11*11); N*J                                    # needs sage.modules
+        sage: # needs sage.combinat sage.modules
+        sage: D = designs.HadamardDesign(11); N = D.incidence_matrix()
+        sage: J = matrix(ZZ, 11, 11, [1]*11*11); N*J
         [5 5 5 5 5 5 5 5 5 5 5]
         [5 5 5 5 5 5 5 5 5 5 5]
         [5 5 5 5 5 5 5 5 5 5 5]
@@ -1010,7 +1016,8 @@ def Hadamard3Design(n):
 
     EXAMPLES::
 
-        sage: designs.Hadamard3Design(12)                                               # needs sage.modules
+        sage: # needs sage.combinat sage.modules
+        sage: designs.Hadamard3Design(12)
         Incidence structure with 12 points and 22 blocks
 
     We verify that any two blocks of the Hadamard `3`-design `3-(8, 4, 1)`
@@ -1020,9 +1027,10 @@ def Hadamard3Design(n):
 
     ::
 
-        sage: D = designs.Hadamard3Design(8)                                            # needs sage.modules
-        sage: N = D.incidence_matrix()                                                  # needs sage.modules
-        sage: N.transpose()*N                                                           # needs sage.modules
+        sage: # needs sage.combinat sage.modules
+        sage: D = designs.Hadamard3Design(8)
+        sage: N = D.incidence_matrix()
+        sage: N.transpose()*N
         [4 2 2 2 2 2 2 2 2 2 2 2 2 0]
         [2 4 2 2 2 2 2 2 2 2 2 2 0 2]
         [2 2 4 2 2 2 2 2 2 2 2 0 2 2]

src/sage/combinat/designs/database.py

@@ -1466,8 +1466,8 @@ def OA_17_560():
 
         sage: from sage.combinat.designs.designs_pyx import is_orthogonal_array
         sage: from sage.combinat.designs.database import OA_17_560
-        sage: OA = OA_17_560()                                                          # needs sage.rings.finite_rings
-        sage: is_orthogonal_array(OA,17,560,2)                                          # needs sage.rings.finite_rings
+        sage: OA = OA_17_560()                                                          # needs sage.rings.finite_rings sage.schemes
+        sage: is_orthogonal_array(OA,17,560,2)                                          # needs sage.rings.finite_rings sage.schemes
         True
 
     The design is available from the general constructor::
@@ -3845,13 +3845,13 @@ def DM_57_8_1():
 
         sage: from sage.combinat.designs.designs_pyx import is_difference_matrix
         sage: from sage.combinat.designs.database import DM_57_8_1
-        sage: G,M = DM_57_8_1()                                                         # needs sage.rings.finite_rings
-        sage: is_difference_matrix(M,G,8,1)                                             # needs sage.rings.finite_rings
+        sage: G,M = DM_57_8_1()                                                         # needs sage.rings.finite_rings sage.schemes
+        sage: is_difference_matrix(M,G,8,1)                                             # needs sage.rings.finite_rings sage.schemes
         True
 
     Can be obtained from the constructor::
 
-        sage: _ = designs.difference_matrix(57,8)                                       # needs sage.rings.finite_rings
+        sage: _ = designs.difference_matrix(57,8)                                       # needs sage.rings.finite_rings sage.schemes
     """
     M = orthogonal_array(8,8)
     M = [R for R in M if any(x!=R[0] for x in R)] # removing the 0..0, 1..1, 7..7 rows.

src/sage/combinat/designs/group_divisible_designs.py

@@ -257,6 +257,7 @@ class GroupDivisibleDesign(IncidenceStructure):
 
     With unspecified groups::
 
+        sage: # needs sage.schemes
         sage: D = designs.transversal_design(4,3).relabel(list('abcdefghiklm'),inplace=False).blocks()
         sage: GDD = GroupDivisibleDesign('abcdefghiklm',None,D)
         sage: sorted(GDD.groups())
@@ -321,8 +322,9 @@ def groups(self):
 
         Non-integer ground set::
 
-            sage: TD=designs.transversal_design(5,5)
-            sage: TD.relabel({i:chr(97+i) for i in range(25)})
+            sage: # needs sage.schemes
+            sage: TD = designs.transversal_design(5,5)
+            sage: TD.relabel({i: chr(97+i) for i in range(25)})
             sage: TD.groups()
             [['a', 'b', 'c', 'd', 'e'],
              ['f', 'g', 'h', 'i', 'j'],