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

sage/combinat/crystals/infinity_crystals.py

@@ -12,7 +12,7 @@ AUTHORS:
 - Travis Scrimshaw: initial version
 """
 
-#*****************************************************************************
+# ***************************************************************************
 #       Copyright (C) 2013 Ben Salisbury <bsalisbury1 at gmail.com>
 #                          Travis Scrimshaw <tscrim at ucdavis.edu>
 #
@@ -25,13 +25,12 @@ AUTHORS:
 #
 #  The full text of the GPL is available at:
 #
-#                  http://www.gnu.org/licenses/
-#****************************************************************************
+#                  https://www.gnu.org/licenses/
+# **************************************************************************
 
 from sage.structure.parent import Parent
 from sage.categories.infinite_enumerated_sets import InfiniteEnumeratedSets
 from sage.categories.highest_weight_crystals import HighestWeightCrystals
-from sage.categories.crystals import Crystals
 from sage.categories.supercrystals import SuperCrystals
 from sage.categories.homset import Hom
 from sage.misc.cachefunc import cached_method
@@ -41,9 +40,10 @@ from sage.combinat.partition import Partition
 from sage.combinat.root_system.cartan_type import CartanType
 from sage.combinat.crystals.letters import CrystalOfLetters
 from sage.combinat.crystals.tensor_product import CrystalOfWords
-from sage.combinat.crystals.tensor_product_element import (CrystalOfTableauxElement,
-        InfinityCrystalOfTableauxElement, InfinityCrystalOfTableauxElementTypeD,
-        InfinityQueerCrystalOfTableauxElement)
+from sage.combinat.crystals.tensor_product_element import (
+    CrystalOfTableauxElement,
+    InfinityCrystalOfTableauxElement, InfinityCrystalOfTableauxElementTypeD,
+    InfinityQueerCrystalOfTableauxElement)
 
 
 class InfinityCrystalOfTableaux(CrystalOfWords):
@@ -503,13 +503,13 @@ class InfinityCrystalOfTableaux(CrystalOfWords):
             for r in range(len(tab)):
                 for c in range(len(tab[r])):
                     if tab[r][c] != r+1:
-                        if [r,tab[r][c]] not in segments:
-                            segments.append([r,tab[r][c]])
+                        if [r, tab[r][c]] not in segments:
+                            segments.append([r, tab[r][c]])
             if self.parent().cartan_type().type() == 'B':
                 for r in range(len(tab)):
                     for c in range(len(tab[r])):
                         if tab[r][c] == 0 and tab[r][-1] == -r-1:
-                            segments.remove([r,tab[r][c]])
+                            segments.remove([r, tab[r][c]])
             if self.parent().cartan_type().type() == 'D':
                 n = self.parent().cartan_type().rank()
                 add = []
@@ -517,14 +517,14 @@ class InfinityCrystalOfTableaux(CrystalOfWords):
                     if tab[r][-1] == -1*(r+1):
                         for c in range(len(tab[r])):
                             if tab[r][c] != n and tab[r][c] != -n:
-                                if [r,n] not in add:
-                                    add.append([r,n])
+                                if [r, n] not in add:
+                                    add.append([r, n])
                 if len(add) > 0:
-                    segments.append([r,n])
+                    segments.append([r, n])
             if self.parent().cartan_type().type() == 'G':
                 for c in range(len(tab[0])):
                     if tab[0][c] == 0 and tab[0][-1] == -1:
-                        segments.remove([0,tab[0][c]])
+                        segments.remove([0, tab[0][c]])
             return len(segments)
 
         def content(self):
@@ -557,11 +557,11 @@ class InfinityCrystalOfTableaux(CrystalOfWords):
             tab = self.to_tableau()
             count = 0
             ct = self.parent().cartan_type().type()
-            for i,row in enumerate(tab):
+            for i, row in enumerate(tab):
                 for entry in row:
-                    if entry == -i-1 and ct in ('B', 'D', 'G'):
+                    if entry == -i - 1 and ct in ('B', 'D', 'G'):
                         count += 2
-                    elif entry != i+1:
+                    elif entry != i + 1:
                         count += 1
             return count
 
@@ -637,7 +637,7 @@ class InfinityCrystalOfTableauxTypeD(InfinityCrystalOfTableaux):
 
 
 #########################################################
-## Queer superalgebra
+#  Queer superalgebra
 
 class DualInfinityQueerCrystalOfTableaux(CrystalOfWords):
     @staticmethod

sage/combinat/crystals/kac_modules.py

@@ -431,7 +431,7 @@ class CrystalOfOddNegativeRoots(UniqueRepresentation, Parent):
             """
             WLR = self.parent().weight_lattice_realization()
             e = WLR.basis()
-            return WLR.sum(-e[i]+e[j] for (i,j) in self.value)
+            return WLR.sum(-e[i] + e[j] for i, j in self.value)
 
 
 class CrystalOfKacModule(UniqueRepresentation, Parent):

sage/combinat/crystals/kirillov_reshetikhin.py

@@ -1587,8 +1587,8 @@ class KR_type_A2(KirillovReshetikhinGenericCrystal):
         sage: G = K.digraph()
         sage: Gdual = Kdual.digraph()
         sage: f = {0:2, 1:1, 2:0}
-        sage: Gnew = DiGraph(); Gnew.add_vertices(Gdual.vertices(sort=True)); Gnew.add_edges([(u,v,f[i]) for (u,v,i) in Gdual.edges(sort=True)])
-        sage: G.is_isomorphic(Gnew, edge_labels = True)
+        sage: Gnew = DiGraph(); Gnew.add_vertices(Gdual.vertices(sort=True)); Gnew.add_edges([(u,v,f[i]) for u, v, i in Gdual.edges(sort=True)])
+        sage: G.is_isomorphic(Gnew, edge_labels=True)
         True
     """
 

sage/combinat/crystals/littelmann_path.py

@@ -836,7 +836,7 @@ class CrystalOfProjectedLevelZeroLSPaths(CrystalOfLSPaths):
             return sum(q**(c[0].energy_function()) * B.sum(B(weight(b)) for b in c) for c in C)
         return B.sum(q**(b.energy_function()) * B(weight(b)) for b in self)
 
-    def is_perfect(self, level=1):
+    def is_perfect(self, level=1) -> bool:
         r"""
         Check whether the crystal ``self`` is perfect (of level ``level``).
 

sage/combinat/crystals/pbw_datum.pyx

@@ -87,10 +87,11 @@ class PBWDatum():
                 self.long_word == other_PBWDatum.long_word and
                 self.lusztig_datum == other_PBWDatum.lusztig_datum)
 
-    def is_equivalent_to(self, other_pbw_datum):
+    def is_equivalent_to(self, other_pbw_datum) -> bool:
         r"""
         Return whether ``self`` is equivalent to ``other_pbw_datum``.
-        modulo the tropical Plücker relations.
+
+        Here equivalent means modulo the tropical Plücker relations.
 
         EXAMPLES::
 

sage/combinat/crystals/tensor_product.py

@@ -966,8 +966,9 @@ class CrystalOfTableaux(CrystalOfWords):
                 raise ValueError("shapes should all be partitions")
             S = CrystalOfSpins(cartan_type)
         B = CrystalOfTableaux(cartan_type, shapes=shapes)
-        T = TensorProductOfCrystals(S, B, generators=[[S.module_generators[0],x] for x in B.module_generators])
-        T.rename("The crystal of tableaux of type %s and shape(s) %s" % (cartan_type, list(list(shape) for shape in spin_shapes)))
+        T = TensorProductOfCrystals(S, B, generators=[[S.module_generators[0], x] for x in B.module_generators])
+        T.rename("The crystal of tableaux of type %s and shape(s) %s" %
+                 (cartan_type, [list(shape) for shape in spin_shapes]))
         T.shapes = spin_shapes
         return T
 
@@ -988,13 +989,14 @@ class CrystalOfTableaux(CrystalOfWords):
             sage: T = crystals.Tableaux(['A',3], shape = [2,2])
             sage: TestSuite(T).run()
         """
-#        super().__init__(category = FiniteEnumeratedSets())
+        # super().__init__(category = FiniteEnumeratedSets())
         Parent.__init__(self, category=ClassicalCrystals())
         self.letters = CrystalOfLetters(cartan_type)
         self.shapes = shapes
-        self.module_generators = tuple(self.module_generator(la) for la in shapes)
+        self.module_generators = tuple(self.module_generator(la)
+                                       for la in shapes)
         self.rename("The crystal of tableaux of type %s and shape(s) %s"
-                    % (cartan_type, list(list(shape) for shape in shapes)))
+                    % (cartan_type, [list(shape) for shape in shapes]))
 
     def cartan_type(self):
         """

sage/combinat/debruijn_sequence.pyx

@@ -112,7 +112,7 @@ cdef gen(int t, int p, k, n):
             gen(t + 1, t, k, n)
 
 
-def is_debruijn_sequence(seq, k, n):
+def is_debruijn_sequence(seq, k, n) -> bool:
     r"""
     Given a sequence of integer elements in `0, \ldots, k-1`, tests whether it
     corresponds to a De Bruijn sequence of parameters `k` and `n`.
@@ -134,7 +134,6 @@ def is_debruijn_sequence(seq, k, n):
         sage: is_debruijn_sequence([1] + s[1:], 2, 3)
         False
     """
-
     if k == 1:
         return seq == [0]