sage.combinat: Add # optional

Author: Matthias Koeppe

src/sage/combinat/designs/bibd.py

@@ -75,12 +75,12 @@ def biplane(n, existence=False):
 
      - ``existence`` (boolean) -- instead of building the design, return:
 
-        - ``True`` -- meaning that Sage knows how to build the design
+       - ``True`` -- meaning that Sage knows how to build the design
 
-        - ``Unknown`` -- meaning that Sage does not know how to build the
-          design, but that the design may exist (see :mod:`sage.misc.unknown`).
+       - ``Unknown`` -- meaning that Sage does not know how to build the
+         design, but that the design may exist (see :mod:`sage.misc.unknown`).
 
-        - ``False`` -- meaning that the design does not exist.
+       - ``False`` -- meaning that the design does not exist.
 
     .. SEEALSO::
 

src/sage/combinat/designs/designs_pyx.pyx

@@ -376,10 +376,10 @@ def is_pairwise_balanced_design(blocks,v,K=None,lambd=1,verbose=False):
         sage: is_pairwise_balanced_design(TD + groups, 40, [10], 1, verbose=True)       # optional - sage.modules
         a block has size 4 while K=[10]
         False
-        sage: is_pairwise_balanced_design([[2,2]],40,[2],1,verbose=True)
+        sage: is_pairwise_balanced_design([[2,2]], 40, [2], 1, verbose=True)
         The following block has repeated elements: [2, 2]
         False
-        sage: is_pairwise_balanced_design([["e",2]],40,[2],1,verbose=True)
+        sage: is_pairwise_balanced_design([["e",2]], 40, [2], 1, verbose=True)
         e does not belong to [0,...,39]
         False
     """

src/sage/combinat/designs/difference_matrices.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Difference Matrices
 
@@ -146,12 +147,12 @@ def difference_matrix(g,k,lmbda=1,existence=False,check=True):
 
     - ``existence`` (boolean) -- instead of building the design, return:
 
-        - ``True`` -- meaning that Sage knows how to build the design
+      - ``True`` -- meaning that Sage knows how to build the design
 
-        - ``Unknown`` -- meaning that Sage does not know how to build the
-          design, but that the design may exist (see :mod:`sage.misc.unknown`).
+      - ``Unknown`` -- meaning that Sage does not know how to build the
+        design, but that the design may exist (see :mod:`sage.misc.unknown`).
 
-        - ``False`` -- meaning that the design does not exist.
+      - ``False`` -- meaning that the design does not exist.
 
       .. NOTE::
 

src/sage/combinat/designs/evenly_distributed_sets.pyx

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Evenly distributed sets in finite fields
 

src/sage/combinat/designs/group_divisible_designs.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Group-Divisible Designs (GDD)
 

src/sage/combinat/designs/incidence_structures.py

@@ -105,8 +105,8 @@ class IncidenceStructure():
     Or by its adjacency matrix (a `\{0,1\}`-matrix in which rows are indexed by
     points and columns by blocks)::
 
-        sage: m = matrix([[0,1,0],[0,0,1],[1,0,1],[1,1,1]])
-        sage: IncidenceStructure(m)
+        sage: m = matrix([[0,1,0],[0,0,1],[1,0,1],[1,1,1]])                             # optional - sage.modules
+        sage: IncidenceStructure(m)                                                     # optional - sage.modules
         Incidence structure with 4 points and 3 blocks
 
     The points can be any (hashable) object::
@@ -736,7 +736,7 @@ def num_points(self):
 
         EXAMPLES::
 
-            sage: designs.DesarguesianProjectivePlaneDesign(2).num_points()
+            sage: designs.DesarguesianProjectivePlaneDesign(2).num_points()             # optional - sage.rings.finite_rings
             7
             sage: B = IncidenceStructure(4, [[0,1],[0,2],[0,3],[1,2], [1,2,3]])
             sage: B.num_points()
@@ -750,7 +750,7 @@ def num_blocks(self):
 
         EXAMPLES::
 
-            sage: designs.DesarguesianProjectivePlaneDesign(2).num_blocks()
+            sage: designs.DesarguesianProjectivePlaneDesign(2).num_blocks()             # optional - sage.rings.finite_rings
             7
             sage: B = IncidenceStructure(4, [[0,1],[0,2],[0,3],[1,2], [1,2,3]])
             sage: B.num_blocks()
@@ -1175,7 +1175,7 @@ def incidence_graph(self,labels=False):
 
             sage: BD = IncidenceStructure(7, [[0,1,2],[0,3,4],[0,5,6],[1,3,5],
             ....:                             [1,4,6],[2,3,6],[2,4,5]])
-            sage: BD.incidence_graph()
+            sage: BD.incidence_graph()                                                  # optional - sage.modules
             Bipartite graph on 14 vertices
             sage: A = BD.incidence_matrix()                                             # optional - sage.modules
             sage: Graph(block_matrix([[A*0, A],                                         # optional - sage.modules
@@ -1222,14 +1222,14 @@ def is_berge_cyclic(self):
 
         EXAMPLES::
 
-            sage: Hypergraph(5, [[1, 2, 3], [2, 3 ,4]]).is_berge_cyclic()
+            sage: Hypergraph(5, [[1, 2, 3], [2, 3, 4]]).is_berge_cyclic()               # optional - sage.modules
             True
-            sage: Hypergraph(6, [[1, 2, 3], [3 ,4, 5]]).is_berge_cyclic()
+            sage: Hypergraph(6, [[1, 2, 3], [3, 4, 5]]).is_berge_cyclic()               # optional - sage.modules
             False
 
         TESTS::
 
-            sage: Hypergraph(5, [[1, 2, 3], [2, 3]]).is_berge_cyclic()
+            sage: Hypergraph(5, [[1, 2, 3], [2, 3]]).is_berge_cyclic()                  # optional - sage.modules
             Traceback (most recent call last):
             ...
             TypeError: Berge cycles are defined for uniform hypergraphs only
@@ -1698,13 +1698,13 @@ def is_generalized_quadrangle(self, verbose=False, parameters=False):
 
         EXAMPLES::
 
-            sage: h = designs.CremonaRichmondConfiguration()
-            sage: h.is_generalized_quadrangle()
+            sage: h = designs.CremonaRichmondConfiguration()                            # optional - networkx
+            sage: h.is_generalized_quadrangle()                                         # optional - networkx
             True
 
         This is actually a *regular* generalized quadrangle::
 
-            sage: h.is_generalized_quadrangle(parameters=True)
+            sage: h.is_generalized_quadrangle(parameters=True)                          # optional - networkx
             (2, 2)
 
         TESTS::
@@ -1773,8 +1773,8 @@ def dual(self, algorithm=None):
 
         The dual of a projective plane is a projective plane::
 
-            sage: PP = designs.DesarguesianProjectivePlaneDesign(4)
-            sage: PP.dual().is_t_design(return_parameters=True)                         # optional - sage.modules
+            sage: PP = designs.DesarguesianProjectivePlaneDesign(4)                     # optional - sage.rings.finite_rings
+            sage: PP.dual().is_t_design(return_parameters=True)                         # optional - sage.rings.finite_rings sage.modules
             (True, (2, 21, 5, 1))
 
         TESTS::
@@ -1817,14 +1817,14 @@ def automorphism_group(self):
 
         EXAMPLES::
 
-            sage: P = designs.DesarguesianProjectivePlaneDesign(2); P
+            sage: P = designs.DesarguesianProjectivePlaneDesign(2); P                   # optional - sage.rings.finite_rings
             (7,3,1)-Balanced Incomplete Block Design
-            sage: G = P.automorphism_group()                                            # optional - sage.groups
-            sage: G.is_isomorphic(PGL(3,2))                                             # optional - sage.groups
+            sage: G = P.automorphism_group()                                            # optional - sage.groups sage.rings.finite_rings
+            sage: G.is_isomorphic(PGL(3,2))                                             # optional - sage.groups sage.rings.finite_rings
             True
-            sage: G                                                                     # optional - sage.groups
+            sage: G                                                                     # optional - sage.groups sage.rings.finite_rings
             Permutation Group with generators [...]
-            sage: G.cardinality()                                                       # optional - sage.groups
+            sage: G.cardinality()                                                       # optional - sage.groups sage.rings.finite_rings
             168
 
         A non self-dual example::

src/sage/combinat/designs/orthogonal_arrays.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Orthogonal arrays (OA)
 
@@ -1954,7 +1955,8 @@ def OA_from_PBD(k,n,PBD, check=True):
         sage: OA_from_PBD(4,10,pbd)
         Traceback (most recent call last):
         ...
-        EmptySetError: There is no OA(n+1,n) - 3.OA(n+1,1) as all blocks intersect in a projective plane.
+        EmptySetError: There is no OA(n+1,n) - 3.OA(n+1,1)
+        as all blocks intersect in a projective plane.
 
     Or an `OA(3,6)` (as the PBD has 10 points)::
 

src/sage/combinat/designs/orthogonal_arrays_build_recursive.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Orthogonal arrays (build recursive constructions)
 

src/sage/combinat/designs/orthogonal_arrays_find_recursive.pyx

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 # cython: cdivision=True
 r"""
 Orthogonal arrays (find recursive constructions)

src/sage/combinat/designs/resolvable_bibd.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.rings.finite_rings
 r"""
 Resolvable Balanced Incomplete Block Design (RBIBD)