some fixes by ruff about nested max

Author: fchapoton

src/sage/combinat/rigged_configurations/rigged_configuration_element.py

@@ -826,7 +826,7 @@ def epsilon(self, a):
         a = self.parent()._rc_index_inverse[a]
         if not self[a]:
             return ZZ.zero()
-        return Integer(-min(0, min(self[a].rigging)))
+        return Integer(-min(0, *self[a].rigging))
 
     def phi(self, a):
         r"""
@@ -851,7 +851,7 @@ def phi(self, a):
         p_inf = self.parent()._calc_vacancy_number(self, a, float("inf"))
         if not self[a]:
             return Integer(p_inf)
-        return Integer(p_inf - min(0, min(self[a].rigging)))
+        return Integer(p_inf - min(0, *self[a].rigging))
 
     def vacancy_number(self, a, i):
         r"""
@@ -2315,7 +2315,7 @@ def epsilon(self, a):
         if not self[a]:
             epsilon = 0
         else:
-            epsilon = -min(0, min(self[a].rigging))
+            epsilon = -min(0, *self[a].rigging)
         n = len(self.parent()._rc_index)
         if a == n-1: # -1 for indexing
             epsilon *= 2
@@ -2349,7 +2349,7 @@ def phi(self, a):
         if not self[a]:
             phi = p_inf
         else:
-            phi = p_inf - min(0, min(self[a].rigging))
+            phi = p_inf - min(0, *self[a].rigging)
         n = len(self.parent()._rc_index)
         if a == n-1: # -1 for indexing
             phi *= 2

src/sage/combinat/set_partition.py

@@ -1638,7 +1638,7 @@ def is_atomic(self) -> bool:
         for S in self[1:]:
             if maximum_so_far < min(S):
                 return False
-            maximum_so_far = max(maximum_so_far, max(S))
+            maximum_so_far = max(maximum_so_far, *S)
         return True
 
     def standardization(self):

src/sage/combinat/words/finite_word.py

@@ -5538,7 +5538,7 @@ def balance(self):
                 abelian[lost] -= 1
                 abel_max[gain] = max(abel_max[gain], abelian[gain])
                 abel_min[lost] = min(abel_min[lost], abelian[lost])
-            best = max(best, max(abel_max[a] - abel_min[a] for a in alphabet))
+            best = max(best, *(abel_max[a] - abel_min[a] for a in alphabet))
         return best
 
     def is_balanced(self, q=1):

src/sage/homology/homology_vector_space_with_basis.py

@@ -444,7 +444,7 @@ def _test_duality(self, **options):
         tester = self._tester(**options)
         dual = self.dual()
         dims = [a[0] for a in self._indices]
-        for dim in range(max(max(dims), tester._max_runs) + 1):
+        for dim in range(max(*dims, tester._max_runs) + 1):
             n = len(self.basis(dim))
             m = matrix(n, n, [a.eval(b) for a in self.basis(dim) for b in dual.basis(dim)])
             tester.assertEqual(m, 1, f"error in dimension {dim}")

src/sage/matroids/matroids_plot_helpers.py

@@ -708,8 +708,8 @@ def tracklims(lims, x_i=[], y_i=[]):
     """
     if lims is not None and lims[0] is not None and lims[1] is not None and \
        lims[2] is not None and lims[3] is not None:
-        lims = [min(min(x_i), lims[0]), max(max(x_i), lims[1]),
-                min(min(y_i), lims[2]), max(max(y_i), lims[3])]
+        lims = [min(*x_i, lims[0]), max(*x_i, lims[1]),
+                min(*y_i, lims[2]), max(*y_i, lims[3])]
     else:
         lims = [min(x_i), max(x_i), min(y_i), max(y_i)]
     return lims

src/sage/sat/solvers/cryptominisat.py

@@ -137,7 +137,7 @@ def add_clause(self, lits):
             raise ValueError("0 should not appear in the clause: {}".format(lits))
         # cryptominisat does not handle Sage integers
         lits = tuple(int(i) for i in lits)
-        self._nvars = max(self._nvars, max(abs(i) for i in lits))
+        self._nvars = max(self._nvars, *(abs(i) for i in lits))
         self._solver.add_clause(lits)
         self._clauses.append((lits, False, None))
 
@@ -162,7 +162,7 @@ def add_xor_clause(self, lits, rhs=True):
             raise ValueError("0 should not appear in the clause: {}".format(lits))
         # cryptominisat does not handle Sage integers
         lits = tuple(int(i) for i in lits)
-        self._nvars = max(self._nvars, max(abs(i) for i in lits))
+        self._nvars = max(self._nvars, *(abs(i) for i in lits))
         self._solver.add_xor_clause(lits, rhs)
         self._clauses.append((lits, True, rhs))
 

src/sage/sat/solvers/picosat.py

@@ -130,7 +130,7 @@ def add_clause(self, lits):
             raise ValueError("0 should not appear in the clause: {}".format(lits))
         # pycosat does not handle Sage integers
         lits = [int(i) for i in lits]
-        self._nvars = max(self._nvars, max(abs(i) for i in lits))
+        self._nvars = max(self._nvars, *(abs(i) for i in lits))
         self._clauses.append(lits)
 
     def __call__(self, assumptions=None):