gh-36916: `sage.combinat`: Update `# needs`
    
<!-- ^^^^^
Please provide a concise, informative and self-explanatory title.
Don't put issue numbers in there, do this in the PR body below.
For example, instead of "Fixes #1234" use "Introduce new method to
calculate 1+1"
-->
<!-- Describe your changes here in detail -->

<!-- Why is this change required? What problem does it solve? -->
<!-- If this PR resolves an open issue, please link to it here. For
example "Fixes #12345". -->
- Cherry-picked from #35095
<!-- If your change requires a documentation PR, please link it
appropriately. -->

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->
<!-- If your change requires a documentation PR, please link it
appropriately -->
<!-- If you're unsure about any of these, don't hesitate to ask. We're
here to help! -->
<!-- Feel free to remove irrelevant items. -->

- [x] The title is concise, informative, and self-explanatory.
- [ ] The description explains in detail what this PR is about.
- [ ] I have linked a relevant issue or discussion.
- [ ] I have created tests covering the changes.
- [ ] I have updated the documentation accordingly.

### ⌛ Dependencies

<!-- List all open PRs that this PR logically depends on
- #12345: short description why this is a dependency
- #34567: ...
-->

<!-- If you're unsure about any of these, don't hesitate to ask. We're
here to help! -->
    
URL: #36916
Reported by: Matthias Köppe
Reviewer(s): David Coudert

Author: Release Manager

src/sage/coding/binary_code.pyx

@@ -3204,6 +3204,8 @@ cdef class BinaryCodeClassifier:
             ....:  [0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
@@ -3218,14 +3220,16 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,0,1,1,0,0,0,0,1,1,0,1,1,0,1,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
             2304
             sage: size
             2304
 
-            sage: M=Matrix(GF(2),[
+            sage: M = Matrix(GF(2),[
             ....:  [1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,0,0],
             ....:  [0,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,0],
             ....:  [0,0,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0],
@@ -3236,14 +3240,16 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,0,0,0,0,0,1,0,0,1,1,1,1,0,0,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
             136
             sage: size
             136
 
-            sage: M=Matrix(GF(2),[
+            sage: M = Matrix(GF(2),[
             ....:  [0,1,0,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,0,1],
             ....:  [1,0,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0],
             ....:  [0,1,1,1,0,0,0,1,0,0,1,1,0,0,0,1,1,1,0,1,0,0],
@@ -3257,6 +3263,8 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
@@ -3956,7 +3964,7 @@ cdef class BinaryCodeClassifier:
             sage: from sage.coding.binary_code import *
             sage: BC = BinaryCodeClassifier()
             sage: B = BinaryCode(Matrix(GF(2), [[1,1,1,1]]))
-            sage: BC.generate_children(B, 6, 4)
+            sage: BC.generate_children(B, 6, 4)                                         # needs sage.groups
             [
             [1 1 1 1 0 0]
             [0 1 0 1 1 1]

src/sage/coding/codecan/autgroup_can_label.pyx

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.libs.pari
 r"""
 Canonical forms and automorphisms for linear codes over finite fields
 

src/sage/coding/goppa_code.py

@@ -308,7 +308,7 @@ def distance_bound(self):
             [8, 2] Goppa code over GF(2)
             sage: C.distance_bound()
             3
-            sage: C.minimum_distance()
+            sage: C.minimum_distance()                                                  # needs sage.libs.gap
             5
         """
         return 1 + (self._generating_pol).degree()

src/sage/combinat/binary_tree.py

@@ -4261,7 +4261,7 @@ def random_element(self):
 
         EXAMPLES::
 
-            sage: BinaryTrees(5).random_element() # random                              # needs sage.combinat
+            sage: BinaryTrees(5).random_element()  # random                             # needs sage.combinat
             [., [., [., [., [., .]]]]]
             sage: BinaryTrees(0).random_element()                                       # needs sage.combinat
             .

src/sage/combinat/designs/difference_family.py

@@ -1748,7 +1748,7 @@ def supplementary_difference_set_from_rel_diff_set(q, existence=False, check=Tru
     EXAMPLES::
 
         sage: from sage.combinat.designs.difference_family import supplementary_difference_set_from_rel_diff_set
-        sage: supplementary_difference_set_from_rel_diff_set(17) #random                # needs sage.libs.pari
+        sage: supplementary_difference_set_from_rel_diff_set(17)  #random               # needs sage.libs.pari
         (Additive abelian group isomorphic to Z/16,
          [[(1), (5), (6), (7), (9), (13), (14), (15)],
           [(0), (2), (3), (5), (6), (10), (11), (13), (14)],

src/sage/combinat/designs/latin_squares.py

@@ -291,12 +291,12 @@ def mutually_orthogonal_latin_squares(k, n, partitions=False, check=True):
 
         sage: designs.orthogonal_arrays.is_available(5+2, 5) # 5 MOLS of order 5
         False
-        sage: designs.orthogonal_arrays.is_available(4+2,6) # 4 MOLS of order 6         # needs sage.schemes
+        sage: designs.orthogonal_arrays.is_available(4+2,6)  # 4 MOLS of order 6        # needs sage.schemes
         False
 
     Sage, however, is not able to prove that the second MOLS do not exist::
 
-        sage: designs.orthogonal_arrays.exists(4+2,6) # 4 MOLS of order 6               # needs sage.schemes
+        sage: designs.orthogonal_arrays.exists(4+2,6)  # 4 MOLS of order 6              # needs sage.schemes
         Unknown
 
     If you ask for such a MOLS then you will respectively get an informative

src/sage/combinat/free_module.py

@@ -936,7 +936,7 @@ def get_order(self):
         EXAMPLES::
 
             sage: QS2 = SymmetricGroupAlgebra(QQ,2)                                     # needs sage.combinat
-            sage: QS2.get_order() # note: order changed on 2009-03-13                   # needs sage.combinat
+            sage: QS2.get_order()  # note: order changed on 2009-03-13                  # needs sage.combinat
             [[2, 1], [1, 2]]
         """
         if self._order is None:

src/sage/combinat/multiset_partition_into_sets_ordered.py

@@ -3394,7 +3394,7 @@ def val(self, q='q'):
 
         Verifying Example 4.5 from [BCHOPSY2017]_::
 
-            sage: B = crystals.Minimaj(3, 4, 2) # for `Val_{4,1}^{(3)}`                 # needs sage.modules
+            sage: B = crystals.Minimaj(3, 4, 2)  # for `Val_{4,1}^{(3)}`                # needs sage.modules
             sage: B.val()                                                               # needs sage.modules
             (q^2+q+1)*s[2, 1, 1] + q*s[2, 2]
         """

src/sage/combinat/partition.py

@@ -5548,9 +5548,9 @@ def simple_module_dimension(self, base_ring=None):
 
             sage: Partition([2,2,1]).simple_module_dimension()
             5
-            sage: Partition([2,2,1]).specht_module_dimension(GF(3))                     # optional - sage.rings.finite_rings
+            sage: Partition([2,2,1]).specht_module_dimension(GF(3))                     # needs sage.rings.finite_rings
             5
-            sage: Partition([2,2,1]).simple_module_dimension(GF(3))                     # optional - sage.rings.finite_rings
+            sage: Partition([2,2,1]).simple_module_dimension(GF(3))                     # needs sage.rings.finite_rings
             4
 
             sage: for la in Partitions(6, regular=3):
@@ -6735,9 +6735,9 @@ def random_element(self, measure='uniform'):
 
         EXAMPLES::
 
-            sage: Partitions(5).random_element() # random                               # needs sage.libs.flint
+            sage: Partitions(5).random_element()  # random                              # needs sage.libs.flint
             [2, 1, 1, 1]
-            sage: Partitions(5).random_element(measure='Plancherel') # random           # needs sage.libs.flint
+            sage: Partitions(5).random_element(measure='Plancherel')  # random          # needs sage.libs.flint
             [2, 1, 1, 1]
         """
         if measure == 'uniform':
@@ -6755,7 +6755,7 @@ def random_element_uniform(self):
 
             sage: Partitions(5).random_element_uniform()  # random                      # needs sage.libs.flint
             [2, 1, 1, 1]
-            sage: Partitions(20).random_element_uniform() # random                      # needs sage.libs.flint
+            sage: Partitions(20).random_element_uniform()  # random                     # needs sage.libs.flint
             [9, 3, 3, 2, 2, 1]
 
         TESTS::

src/sage/combinat/plane_partition.py

@@ -1548,7 +1548,7 @@ def __init__(self, box_size):
         EXAMPLES::
 
             sage: PP = PlanePartitions([4,3,2])
-            sage: TestSuite(PP).run()                                       # long time, needs sage.modules
+            sage: TestSuite(PP).run()           # long time                             # needs sage.modules
         """
         super().__init__(box_size, category=FiniteEnumeratedSets())