passagemath-combinat 10.6.1__cp312-cp312-musllinux_1_2_aarch64.whl → 10.8.1a1__cp312-cp312-musllinux_1_2_aarch64.whl

sage/combinat/integer_matrices.py

@@ -10,12 +10,12 @@ AUTHORS:
 
 - Franco Saliola
 """
-#*****************************************************************************
+# ***************************************************************************
 #       Copyright (C) 2012 Franco Saliola <saliola@gmail.com>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ***************************************************************************
 
 from sage.structure.unique_representation import UniqueRepresentation
 from sage.structure.parent import Parent
@@ -179,9 +179,7 @@ class IntegerMatrices(UniqueRepresentation, Parent):
                 col_sums[j] += x_ij
             if row_sums[i] != self._row_sums[i]:
                 return False
-        if col_sums != self._col_sums:
-            return False
-        return True
+        return col_sums == self._col_sums
 
     def cardinality(self):
         r"""
@@ -324,6 +322,6 @@ def integer_matrices_generator(row_sums, column_sums):
     else:
         I = IntegerListsLex(n=row_sums[0], length=len(column_sums), ceiling=column_sums)
         for comp in I.backend._iter():
-            t = [column_sums[i]-ci for (i, ci) in enumerate(comp)]
+            t = [column_sums[i] - ci for i, ci in enumerate(comp)]
             for mat in integer_matrices_generator(row_sums[1:], t):
                 yield [list(comp)] + mat

sage/combinat/k_tableau.py

@@ -1024,7 +1024,7 @@ class WeakTableau_core(WeakTableau_abstract):
             r = self[0].count(1) - i - 1
             for v in range(1,mu[i]):
                 D = self.dictionary_of_coordinates_at_residues(v+1)
-                new_D = {a: b for (a, b) in D.items()
+                new_D = {a: b for a, b in D.items()
                          if all(x not in already_used for x in b)}
                 r = (r - min([self.k+1 - (x-r) % (self.k+1) for x in new_D])) % (self.k+1)
                 standard_cells.append(new_D[r][-1])
@@ -2566,7 +2566,7 @@ class StrongTableau(ClonableList, metaclass=InheritComparisonClasscallMetaclass)
         Tsizes = [Core(lam, self.k + 1).length() for lam in Tshapes]
         return all(Tsizes[i] == Tsizes[i+1]-1 for i in range(len(Tsizes)-1))
 
-    def is_column_strict_with_weight( self, mu ):
+    def is_column_strict_with_weight(self, mu) -> bool:
         """
         Test if ``self`` is a column strict tableau with respect to the weight ``mu``.
 
@@ -4445,11 +4445,11 @@ class StrongTableaux(UniqueRepresentation, Parent):
             # a valid or invalid transposition?
             if msh.length() == sh.length() - 1:
                 # if applying t_{j-l,j+1} reduces the size of the shape by 1
-                valcells = [] # values in all the cells except content j
-                regcells = [] # values in the cells with content j
+                valcells = []  # values in all the cells except content j
+                regcells = []  # values in the cells with content j
                 valid = True
-                for (x,y) in SkewPartition([P, mP]).cells():
-                    if y-x != j:
+                for x, y in SkewPartition([P, mP]).cells():
+                    if y - x != j:
                         if LL[x][y] != m:
                             valid = False
                             break
@@ -4460,7 +4460,8 @@ class StrongTableaux(UniqueRepresentation, Parent):
                     # if all labels that are not content j are v and the label
                     # with content j = -m
                     mcells = mP.cells()
-                    MM = [[LL[a][b] for b in range(len(LL[a])) if (a,b) in mcells]
+                    MM = [[LL[a][b] for b in range(len(LL[a]))
+                           if (a, b) in mcells]
                           for a in range(len(mP))]
                     transeq = self.marked_CST_to_transposition_sequence(MM, k)
                     if transeq is not None:

sage/combinat/kazhdan_lusztig.py

@@ -9,15 +9,15 @@ AUTHORS:
 - Alan J.X. Guo (2014-03-18): ``R_tilde()`` method
 """
 
-#*****************************************************************************
+# ***************************************************************************
 #       Copyright (C) 2008 Daniel Bump <bump at match.stanford.edu>
 #
 # This program is free software: you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
 # the Free Software Foundation, either version 2 of the License, or
 # (at your option) any later version.
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ***************************************************************************
 
 
 from sage.rings.polynomial.polynomial_element import Polynomial