Unused variables.

src/sage/combinat/matrices/latin.py

@@ -1254,8 +1254,6 @@ def find_disjoint_mates(self, nr_to_find = None, allow_subtrade = False):
 
         assert self.nrows() == self.ncols()
 
-        n = self.nrows()
-
         dlx_rows, cmap = self.disjoint_mate_dlxcpp_rows_and_map(allow_subtrade)
 
         nr_found = 0
@@ -2200,7 +2198,6 @@ def LatinSquare_generator(L_start, check_assertions = False):
     from copy import copy
     L = copy(L_start)
 
-    L_rce = L
     L_cer = LatinSquare(n, n)
     L_erc = LatinSquare(n, n)
 
@@ -2834,8 +2831,6 @@ def dlxcpp_find_completions(P, nr_to_find = None):
     """
     assert P.nrows() == P.ncols()
 
-    n = P.nrows()
-
     dlx_rows, cmap = dlxcpp_rows_and_map(P)
 
     SOLUTIONS = {}

src/sage/combinat/rigged_configurations/rigged_configuration_element.py

@@ -546,7 +546,6 @@ def e(self, a):
         if M[a,a] != 2:
             k = None
             set_vac_num = True
-            rigged_index = None
             if new_rigging[-1] != -M[a,a] // 2:
                 return None
             new_list.pop()
@@ -2389,7 +2388,7 @@ def cocharge(self):
             True
         """
         #return self.to_virtual_configuration().cocharge() / self.parent()._folded_ct.gamma[0]
-        vct = self.parent()._folded_ct
+        # vct = self.parent()._folded_ct
         cc = ZZ.zero()
         rigging_sum = ZZ.zero()
         #sigma = vct.folding_orbit()

src/sage/combinat/sf/hecke.py

@@ -168,7 +168,6 @@ def __init__(self, sym, q='q'):
         self._p = sym.power()
 
         # temporary until Hom(GradedHopfAlgebrasWithBasis work better)
-        category = ModulesWithBasis(self._sym.base_ring())
         self   .register_coercion(self._p._module_morphism(self._p_to_qbar_on_basis,
                                                            codomain=self))
         self._p.register_coercion(self._module_morphism(self._qbar_to_p_on_basis,

src/sage/combinat/tableau_tuple.py

@@ -3499,7 +3499,7 @@ def tableau_from_list(tab):
                                       check=False)
 
         # now run through the linear extensions and return the corresponding tableau
-        for lin in Poset((range(1, mu.size()+1), relations)).linear_extensions():
+        for lin in Poset((range(1, n+1), relations)).linear_extensions():
             linear_tab = list(permutation.Permutation(lin).inverse())
             yield tableau_from_list(linear_tab)