gh-36963: some care for pep8 code E241 in some pyx files
    
just fixing a few cases of pep8 E241 (spaces before commas) in some pyx
files

### 📝 Checklist

- [x] The title is concise, informative, and self-explanatory.
- [x] The description explains in detail what this PR is about.
    
URL: #36963
Reported by: Frédéric Chapoton
Reviewer(s): David Coudert

Author: Release Manager

src/sage/coding/codecan/codecan.pyx

@@ -920,8 +920,8 @@ cdef class PartitionRefinementLinearCode(PartitionRefinement_generic):
         if self._inner_group.rank < 2:
             return True
 
-        lower = iter(self._matrix[ : self._inner_group.rank  ].columns())
-        upper = iter(self._matrix[ self._inner_group.rank :  ].columns())
+        lower = iter(self._matrix[ : self._inner_group.rank].columns())
+        upper = iter(self._matrix[self._inner_group.rank : ].columns())
 
         for i in range(self._n):
             l = next(lower)

src/sage/combinat/crystals/tensor_product_element.pyx

@@ -1867,4 +1867,4 @@ cdef Py_ssize_t count_leading(list row, letter) noexcept:
 
 # for unpickling
 from sage.misc.persist import register_unpickle_override
-register_unpickle_override('sage.combinat.crystals.tensor_product', 'ImmutableListWithParent',  ImmutableListWithParent)
+register_unpickle_override('sage.combinat.crystals.tensor_product', 'ImmutableListWithParent', ImmutableListWithParent)

src/sage/combinat/designs/orthogonal_arrays_find_recursive.pyx

@@ -732,69 +732,68 @@ cpdef find_brouwer_separable_design(int k,int n) noexcept:
         False
     """
     from sage.combinat.designs.orthogonal_arrays_build_recursive import brouwer_separable_design
-    cdef int q,x,baer_subplane_size, max_t, min_t, t,e1,e2,e3,e4
+    cdef int q, x, baer_subplane_size, max_t, min_t, t, e1, e2, e3, e4
 
-    for q in prime_powers(2,n):
-        baer_subplane_size = q**2+q+1
+    for q in prime_powers(2, n):
+        baer_subplane_size = q**2 + q + 1
         if baer_subplane_size > n:
             break
         #                       x <= q^2+1
         # <=>        n-t(q^2+q+1) <= q^2+1
         # <=>             n-q^2-1 <= t(q^2+q+1)
         # <=> (n-q^2-1)/(q^2+q+1) <= t
 
-        min_t = (n-q**2-1)/baer_subplane_size
-        max_t = min(n/baer_subplane_size,q**2-q+1)
+        min_t = (n - q**2 - 1) / baer_subplane_size
+        max_t = min(n / baer_subplane_size, q**2 - q + 1)
 
-        for t in range(min_t,max_t+1):
-            x = n - t*baer_subplane_size
-            e1 = int(x != q**2-q-t)
+        for t in range(min_t, max_t + 1):
+            x = n - t * baer_subplane_size
+            e1 = int(x != q**2 - q - t)
             e2 = int(x != 1)
             e3 = int(x != q**2)
-            e4 = int(x != t+q+1)
+            e4 = int(x != t + q + 1)
 
             # i)
             if (x == 0 and
-                is_available(k, t)  and
-                is_available(k,t+q)):
-                return brouwer_separable_design, (k,t,q,x)
+                    is_available(k, t) and is_available(k, t + q)):
+                return brouwer_separable_design, (k, t, q, x)
 
             # ii)
-            elif (x == t+q and
-                  is_available(k+e3,  t  ) and
-                  is_available(  k , t+q ) and
-                  is_available(k+1 ,t+q+1)):
-                return brouwer_separable_design, (k,t,q,x)
+            elif (x == t + q and
+                  is_available(k + e3, t) and
+                  is_available(k, t + q) and
+                  is_available(k + 1, t + q + 1)):
+                return brouwer_separable_design, (k, t, q, x)
 
             # iii)
-            elif (x == q**2-q+1-t and
-                  is_available(  k  ,  x  ) and
-                  is_available( k+e2, t+1 ) and
-                  is_available( k+1 , t+q )):
-                return brouwer_separable_design, (k,t,q,x)
+            elif (x == q**2 - q + 1 - t and
+                  is_available(k, x) and
+                  is_available(k + e2, t + 1)
+                  and is_available(k + 1, t + q)):
+                return brouwer_separable_design, (k, t, q, x)
 
             # iv)
-            elif (x == q**2+1 and
-                  is_available(  k  ,  x  ) and
-                  is_available( k+e4, t+1 ) and
-                  is_available( k+1 ,t+q+1)):
-                return brouwer_separable_design, (k,t,q,x)
+            elif (x == q**2 + 1 and
+                  is_available(k, x) and
+                  is_available(k + e4, t + 1) and
+                  is_available(k + 1, t + q + 1)):
+                return brouwer_separable_design, (k, t, q, x)
 
             # v)
-            elif (0<x and x<q**2-q+1-t and (e1 or e2) and
-                  is_available(  k  ,  x  ) and
-                  is_available( k+e1,  t  ) and
-                  is_available( k+e2, t+1 ) and
-                  is_available( k+1 , t+q )):
-                return brouwer_separable_design, (k,t,q,x)
+            elif (0 < x < q**2 - q + 1 - t and (e1 or e2) and
+                  is_available(k, x) and
+                  is_available(k + e1, t) and
+                  is_available(k + e2, t + 1) and
+                  is_available(k + 1, t + q)):
+                return brouwer_separable_design, (k, t, q, x)
 
             # vi)
-            elif (t+q<x and x<q**2+1 and (e3 or e4) and
-                  is_available(  k  ,  x  ) and
-                  is_available( k+e3,  t  ) and
-                  is_available( k+e4, t+1 ) and
-                  is_available( k+1 ,t+q+1)):
-                return brouwer_separable_design, (k,t,q,x)
+            elif (t + q < x < q**2 + 1 and (e3 or e4) and
+                  is_available(k, x) and
+                  is_available(k + e3, t) and
+                  is_available(k + e4, t + 1) and
+                  is_available(k + 1, t + q + 1)):
+                return brouwer_separable_design, (k, t, q, x)
 
     return False
 
@@ -804,11 +803,11 @@ from sage.combinat.designs.database import QDM as __QDM
 cdef dict _QDM = __QDM
 cdef dict ioa_indexed_by_n_minus_x = {}
 for x in _QDM.itervalues():
-    for (n,_,_,u),(k,_) in x.items():
-        if u>1:
+    for (n, _, _, u), (k, _) in x.items():
+        if u > 1:
             if n not in ioa_indexed_by_n_minus_x:
                 ioa_indexed_by_n_minus_x[n] = []
-            ioa_indexed_by_n_minus_x[n].append((k,u))
+            ioa_indexed_by_n_minus_x[n].append((k, u))
 
 
 def int_as_sum(int value, list S, int k_max):

src/sage/groups/perm_gps/partn_ref/data_structures.pyx

@@ -629,12 +629,12 @@ cdef inline int SC_realloc_gens(StabilizerChain *SC, int level, int size) noexce
     cdef int *temp
     cdef int n = SC.degree
 
-    temp = <int *> sig_realloc( SC.generators[level],   n * size * sizeof(int) )
+    temp = <int *> sig_realloc(SC.generators[level], n * size * sizeof(int))
     if temp is NULL:
         return 1
     SC.generators[level] = temp
 
-    temp = <int *> sig_realloc( SC.gen_inverses[level], n * size * sizeof(int) )
+    temp = <int *> sig_realloc(SC.gen_inverses[level], n * size * sizeof(int))
     if temp is NULL:
         return 1
     SC.gen_inverses[level] = temp

src/sage/groups/perm_gps/partn_ref/double_coset.pyx

@@ -400,14 +400,14 @@ cdef int double_coset(void *S1, void *S2, PartitionStack *partition1, int *order
     cdef bint unknown = 1
 
     # set up the identity permutation
-    for i from 0 <= i < n:
+    for i in range(n):
         id_perm[i] = i
     if ordering2 is NULL:
         ordering2 = id_perm
 
     # Copy reordering of left_ps coming from ordering2 to current_ps.
-    memcpy(current_ps.entries, ordering2,      n*sizeof(int))
-    memcpy(current_ps.levels,  left_ps.levels, n*sizeof(int))
+    memcpy(current_ps.entries, ordering2, n * sizeof(int))
+    memcpy(current_ps.levels, left_ps.levels, n * sizeof(int))
     current_ps.depth = left_ps.depth
 
     # default values of "infinity"

src/sage/matrix/action.pyx

@@ -195,11 +195,10 @@ cdef class MatrixMatrixAction(MatrixMulAction):
             Nonetheless, there is no guarantee that the set that is acted upon
             will always be cached in such a way, so that following the above
             example is good practice.
-
         """
         if self.G.ncols() != self.underlying_set().nrows():
             raise TypeError("incompatible dimensions %s, %s" %
-                    (self.G.ncols(),  self.underlying_set().nrows()))
+                    (self.G.ncols(), self.underlying_set().nrows()))
         return MatrixSpace(base, self.G.nrows(), self.underlying_set().ncols(),
                            sparse = self.G.is_sparse() and self.underlying_set().is_sparse())