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

sage/combinat/chas/wqsym.py

@@ -472,8 +472,14 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
 
             sage: A = algebras.WQSym(QQ)
             sage: TestSuite(A).run()  # long time
+
+            sage: M = algebras.WQSym(ZZ).M()
+            sage: M.is_commutative()
+            False
         """
         category = HopfAlgebras(R).Graded().Connected()
+        if R.is_zero():
+            category = category.Commutative()
         Parent.__init__(self, base=R, category=category.WithRealizations())
 
     def _repr_(self):
@@ -499,7 +505,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
         """
         return self.M()
 
-    _shorthands = tuple(['M', 'X', 'C', 'Q', 'Phi'])
+    _shorthands = ('M', 'X', 'C', 'Q', 'Phi')
 
     # add options to class
     class options(GlobalOptions):
@@ -762,7 +768,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 # for the formula we're using here.
                 Q = self.parent()
                 OSPs = Q.basis().keys()
-                return Q._from_dict({OSPs(A.reversed()): c for (A, c) in self},
+                return Q._from_dict({OSPs(A.reversed()): c for A, c in self},
                                     remove_zeros=False)
 
             def coalgebraic_complement(self):
@@ -799,7 +805,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 # for the formula we're using here.
                 Q = self.parent()
                 OSPs = Q.basis().keys()
-                return Q._from_dict({OSPs(A.complement()): c for (A, c) in self},
+                return Q._from_dict({OSPs(A.complement()): c for A, c in self},
                                     remove_zeros=False)
 
             def star_involution(self):
@@ -835,7 +841,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 # for the formula we're using here.
                 Q = self.parent()
                 OSPs = Q.basis().keys()
-                return Q._from_dict({OSPs(A.complement().reversed()): c for (A, c) in self},
+                return Q._from_dict({OSPs(A.complement().reversed()): c for A, c in self},
                                     remove_zeros=False)
 
     X = Characteristic
@@ -1281,7 +1287,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                     return {OSPs(P): (one if (len(R) % 2 == len(P) % 2)
                                       else mine)
                             for R in Rs for P in R.strongly_fatter()}
-                return Q._from_dict(linear_combination((img(A), c) for (A, c) in self))
+                return Q._from_dict(linear_combination((img(A), c) for A, c in self))
 
             def coalgebraic_complement(self):
                 r"""
@@ -1329,7 +1335,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                     return {OSPs(P): (one if (len(R) % 2 == len(P) % 2)
                                       else mine)
                             for R in Rs for P in R.strongly_fatter()}
-                return Q._from_dict(linear_combination((img(A), c) for (A, c) in self))
+                return Q._from_dict(linear_combination((img(A), c) for A, c in self))
 
             def star_involution(self):
                 r"""
@@ -1364,7 +1370,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 # for the formula we're using here.
                 Q = self.parent()
                 OSPs = Q.basis().keys()
-                return Q._from_dict({OSPs(A.complement().reversed()): c for (A, c) in self},
+                return Q._from_dict({OSPs(A.complement().reversed()): c for A, c in self},
                                     remove_zeros=False)
 
     Q = StronglyCoarser
@@ -1634,7 +1640,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 return self.monomial(x)
             xlist = [(j, (k == 0))
                      for part in x
-                     for (k, j) in enumerate(sorted(part))]
+                     for k, j in enumerate(sorted(part))]
             # xlist is a list of the form
             # [(e_1, s_1), (e_2, s_2), ..., (e_n, s_n)],
             # where e_1, e_2, ..., e_n are the entries of the parts of
@@ -1644,7 +1650,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
             m = max(max(part) for part in x)  # The degree of x
             ylist = [(m + j, (k == 0))
                      for part in y
-                     for (k, j) in enumerate(sorted(part))]
+                     for k, j in enumerate(sorted(part))]
             # ylist is like xlist, but for y instead of x, and with
             # a shift by m.
 
@@ -1749,7 +1755,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                     deconcatenates.append((left, right))
             T = self.tensor_square()
             return T.sum_of_monomials((standardize(left), standardize(right))
-                                      for (left, right) in deconcatenates)
+                                      for left, right in deconcatenates)
 
         class Element(WQSymBasis_abstract.Element):
             def algebraic_complement(self):
@@ -1798,7 +1804,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                     return {OSPs(P): (one if (len(R) % 2 == len(P) % 2)
                                       else mine)
                             for R in Rs for P in R.strongly_finer()}
-                return Phi._from_dict(linear_combination((img(A), c) for (A, c) in self))
+                return Phi._from_dict(linear_combination((img(A), c) for A, c in self))
 
             def coalgebraic_complement(self):
                 r"""
@@ -1846,7 +1852,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                     return {OSPs(P): (one if (len(R) % 2 == len(P) % 2)
                                       else mine)
                             for R in Rs for P in R.strongly_finer()}
-                return Phi._from_dict(linear_combination((img(A), c) for (A, c) in self))
+                return Phi._from_dict(linear_combination((img(A), c) for A, c in self))
 
             def star_involution(self):
                 r"""
@@ -1881,7 +1887,7 @@ class WordQuasiSymmetricFunctions(UniqueRepresentation, Parent):
                 # for the formula we're using here.
                 Phi = self.parent()
                 OSPs = Phi.basis().keys()
-                return Phi._from_dict({OSPs(A.complement().reversed()): c for (A, c) in self},
+                return Phi._from_dict({OSPs(A.complement().reversed()): c for A, c in self},
                                       remove_zeros=False)
 
     Phi = StronglyFiner
@@ -2042,18 +2048,6 @@ class WQSymBases(Category_realization_of_parent):
             """
             return False
 
-        def is_commutative(self):
-            """
-            Return whether ``self`` is commutative.
-
-            EXAMPLES::
-
-                sage: M = algebras.WQSym(ZZ).M()
-                sage: M.is_commutative()
-                False
-            """
-            return self.base_ring().is_zero()
-
         def one_basis(self):
             """
             Return the index of the unit.
@@ -2263,7 +2257,7 @@ class WQSymBases(Category_realization_of_parent):
             # complement componentwise, then convert back.
             parent = self.parent()
             M = parent.realization_of().M()
-            dct = {I.reversed(): coeff for (I, coeff) in M(self)}
+            dct = {I.reversed(): coeff for I, coeff in M(self)}
             return parent(M._from_dict(dct, remove_zeros=False))
 
         def coalgebraic_complement(self):
@@ -2428,7 +2422,7 @@ class WQSymBases(Category_realization_of_parent):
             # complement componentwise, then convert back.
             parent = self.parent()
             M = parent.realization_of().M()
-            dct = {I.complement(): coeff for (I, coeff) in M(self)}
+            dct = {I.complement(): coeff for I, coeff in M(self)}
             return parent(M._from_dict(dct, remove_zeros=False))
 
         def star_involution(self):
@@ -2556,7 +2550,7 @@ class WQSymBases(Category_realization_of_parent):
             # complement componentwise, then convert back.
             parent = self.parent()
             M = parent.realization_of().M()
-            dct = {I.reversed().complement(): coeff for (I, coeff) in M(self)}
+            dct = {I.reversed().complement(): coeff for I, coeff in M(self)}
             return parent(M._from_dict(dct, remove_zeros=False))
 
         def to_quasisymmetric_function(self):
@@ -2598,4 +2592,4 @@ class WQSymBases(Category_realization_of_parent):
             M = QuasiSymmetricFunctions(self.parent().base_ring()).Monomial()
             MW = self.parent().realization_of().M()
             return M.sum_of_terms((i.to_composition(), coeff)
-                                  for (i, coeff) in MW(self))
+                                  for i, coeff in MW(self))

sage/combinat/colored_permutations.py

@@ -8,7 +8,7 @@ Colored permutations
     generalized to `G \wr S_n`
 """
 import itertools
-from random import choice
+from sage.misc.prandom import choice
 
 from sage.structure.element import MultiplicativeGroupElement
 from sage.structure.parent import Parent
@@ -19,7 +19,7 @@ from sage.misc.lazy_import import lazy_import
 from sage.misc.misc_c import prod
 from sage.arith.functions import lcm
 
-from sage.combinat.partition_tuple import PartitionTuples, PartitionTuple
+from sage.combinat.partition_tuple import PartitionTuples
 from sage.combinat.permutation import Permutations
 from sage.rings.finite_rings.integer_mod_ring import IntegerModRing
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
@@ -274,7 +274,7 @@ class ColoredPermutation(MultiplicativeGroupElement):
         """
         Cp = CyclotomicField(self.parent()._m)
         g = Cp.gen()
-        D = diagonal_matrix(Cp, [g ** i for i in self._colors])
+        D = diagonal_matrix(Cp, [g**i for i in self._colors])
         return self._perm.to_matrix() * D
 
     def has_left_descent(self, i) -> bool:
@@ -474,7 +474,7 @@ class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
             return ColoredPermutations(m, n)
         return super().__classcall__(cls, m, p, n)
 
-    def __init__(self, m, p, n):
+    def __init__(self, m, p, n) -> None:
         r"""
         Initialize ``self``.
 
@@ -507,9 +507,7 @@ class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
         self._C = IntegerModRing(self._m)
         self._P = Permutations(self._n)
 
-        if (self._p == 1 and (self._m == 1 or self._m == 2)
-            or (self._p == 2 and self._m == 2)
-            or (self._n == 2 and self._p == self._m)):
+        if self._p <= self._m <= 2 or (self._n == 2 and self._p == self._m):
             from sage.categories.finite_coxeter_groups import FiniteCoxeterGroups
             category = FiniteCoxeterGroups()
             if not (self._n == self._m == self._p == 2):  # special case of type D_2
@@ -521,7 +519,7 @@ class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
                 category = category.WellGenerated()
         Parent.__init__(self, category=category)
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -741,8 +739,8 @@ class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
         if i == self._n + 1 or self._n == 1:
             return sn ** self._p
 
-        snm = self.simple_reflection(self._n-1)
-        return sn**(self._m-1) * snm * sn
+        snm = self.simple_reflection(self._n - 1)
+        return sn**(self._m - 1) * snm * sn
 
     @cached_method
     def _inverse_simple_reflections(self):
@@ -1126,7 +1124,7 @@ class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
             q = PolynomialRing(ZZ, 'q').gen(0)
         return prod(q + d - 1 for d in self.degrees())
 
-    def is_well_generated(self):
+    def is_well_generated(self) -> bool:
         r"""
         Return if ``self`` is a well-generated complex reflection group.
 

sage/combinat/colored_permutations_representations.py

@@ -211,7 +211,7 @@ class TabloidModule(Representation_abstract, CombinatorialFreeModule):
         data = [cartesian_product([OrderedSetPartitions([val * x for x, val in zip(sorted(X), signs)], la),
                                    OrderedSetPartitions(sorted(Y), mu)])
                 for (X, Y) in OrderedSetPartitions(G._n, [sum(la), sum(mu)])
-                for signs in product([1,-1], repeat=sum(la))]
+                for signs in product([1, -1], repeat=sum(la))]
         tabloids = DisjointUnionEnumeratedSets(data)
         tabloids.rename(f"Tabloids of shape {self._diagram}")
 
@@ -511,8 +511,8 @@ class SpechtModule(Representation_abstract, SubmoduleWithBasis):
                 n = T.size()
                 for sigma in T.column_stabilizer():
                     sigma = sigma.tuple()
-                    for signs in product(*[[1,-1] if i not in mu_vals else [1]
-                                           for i in range(1,n+1)]):
+                    for signs in product(*[[1, -1] if i not in mu_vals else [1]
+                                           for i in range(1, n+1)]):
                         yield self._semigroup([s * val for s, val in zip(signs, sigma)])
 
             return ambient.sum_of_terms((ambient._semigroup_basis_action(elt, tab),
@@ -605,7 +605,7 @@ class SpechtModule(Representation_abstract, SubmoduleWithBasis):
         COB = matrix([b.lift().to_vector() for b in B]).T
         P, L, U = COB.LU()
         # Since U is upper triangular, the nonzero entriesm must be in the
-        #   upper square portiion of the matrix
+        #   upper square portion of the matrix
         n = len(B)
 
         Uinv = U.matrix_from_rows(range(n)).inverse()
@@ -906,7 +906,7 @@ class SimpleModule(Representation_abstract, QuotientModuleWithBasis):
         [0 0 0 0 0 0 1 0]
         [0 0 0 0 0 0 0 1]
     """
-    def __init__(self, specht_module):
+    def __init__(self, specht_module) -> None:
         r"""
         Initialize ``self``.
 
@@ -916,18 +916,19 @@ class SimpleModule(Representation_abstract, QuotientModuleWithBasis):
             sage: D = B4.simple_module([[2,1], [1]], GF(3))
             sage: TestSuite(D).run()
         """
-        self._diagram = specht_module._diagram
         p = specht_module.base_ring().characteristic()
-        if (not all(la.is_regular(p) for la in specht_module._diagram)
-            or (p == 2 and specht_module._diagram[0])):
+        d = self._diagram = specht_module._diagram
+        if (p == 2 and d[0]) or not all(la.is_regular(p) for la in d):
             raise ValueError(f"the partition must be {p}-regular")
-        Representation_abstract.__init__(self, specht_module._semigroup, specht_module._side,
+        Representation_abstract.__init__(self, specht_module._semigroup,
+                                         specht_module._side,
                                          algebra=specht_module._semigroup_algebra)
         cat = specht_module.category()
-        QuotientModuleWithBasis.__init__(self, specht_module.maximal_submodule(),
+        QuotientModuleWithBasis.__init__(self,
+                                         specht_module.maximal_submodule(),
                                          cat, prefix='D', bracket='')
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 
@@ -939,7 +940,7 @@ class SimpleModule(Representation_abstract, QuotientModuleWithBasis):
         """
         return f"Simple module of {self._diagram} over {self.base_ring()}"
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.
 

sage/combinat/composition_tableau.py

@@ -200,7 +200,7 @@ class CompositionTableau(CombinatorialElement, metaclass=ClasscallMetaclass):
         for row in self:
             for i in row:
                 w[i] += 1
-        return Composition([w[i] for i in range(1, self.size()+1)])
+        return Composition([w[i] for i in range(1, self.size() + 1)])
 
     def descent_set(self):
         r"""
@@ -254,7 +254,7 @@ class CompositionTableau(CombinatorialElement, metaclass=ClasscallMetaclass):
         """
         return Partition(sorted((len(row) for row in self), reverse=True))
 
-    def is_standard(self):
+    def is_standard(self) -> bool:
         r"""
         Return ``True`` if ``self`` is a standard composition tableau and
         ``False`` otherwise.

sage/combinat/constellation.py

@@ -20,7 +20,7 @@ EXAMPLES::
     g2 (1,3,2)
     sage: C = Constellations(3,4); C
     Connected constellations of length 3 and degree 4 on {1, 2, 3, 4}
-    sage: C.cardinality()  # long time
+    sage: C.cardinality()
     426
 
     sage: C = Constellations(3, 4, domain=('a', 'b', 'c', 'd'))
@@ -59,10 +59,12 @@ from sage.structure.richcmp import (op_NE, op_EQ, richcmp_not_equal,
                                     rich_to_bool)
 
 from sage.rings.integer import Integer
+from sage.rings.integer_ring import ZZ
 from sage.combinat.partition import Partition
 from sage.misc.misc_c import prod
 from sage.misc.lazy_import import lazy_import
 from sage.categories.groups import Groups
+from sage.functions.other import factorial
 
 lazy_import('sage.graphs.graph', 'Graph')
 lazy_import('sage.graphs.digraph', 'DiGraph')
@@ -231,7 +233,7 @@ class Constellation_class(Element):
             raise ValueError("cannot hash mutable constellation")
         return hash(tuple(self._g))
 
-    def set_immutable(self):
+    def set_immutable(self) -> None:
         r"""
         Do nothing, as ``self`` is already immutable.
 
@@ -244,7 +246,7 @@ class Constellation_class(Element):
         """
         self._mutable = False
 
-    def is_mutable(self):
+    def is_mutable(self) -> bool:
         r"""
         Return ``False`` as ``self`` is immutable.
 
@@ -428,7 +430,7 @@ class Constellation_class(Element):
 
     # GENERAL PROPERTIES
 
-    def is_connected(self):
+    def is_connected(self) -> bool:
         r"""
         Test of connectedness.
 
@@ -443,10 +445,9 @@ class Constellation_class(Element):
         """
         if self._connected:
             return True
-        else:
-            return perms_are_connected(self._g, self.degree())
+        return perms_are_connected(self._g, self.degree())
 
-    def connected_components(self):
+    def connected_components(self) -> list:
         """
         Return the connected components.
 
@@ -884,9 +885,9 @@ class Constellation_class(Element):
             g1 (0)(1,4)(2)(3)
             g2 (0,1,3,2,4)
             sage: G = c.braid_group_orbit()
-            sage: G.num_verts()
+            sage: G.n_vertices()
             4
-            sage: G.num_edges()
+            sage: G.n_edges()
             12
         """
         G = DiGraph(multiedges=True, loops=True)
@@ -926,7 +927,11 @@ class Constellations_ld(UniqueRepresentation, Parent):
         """
         TESTS::
 
-            sage: TestSuite(Constellations(length=6,degree=4)).run(skip='_test_cardinality')
+            sage: TestSuite(Constellations(length=6, degree=4)).run()
+
+            sage: TestSuite(Constellations(2, 3, connected=False)).run()
+
+            sage: TestSuite(Constellations(3, 4, domain='abcd')).run()
         """
         from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
         Parent.__init__(self, category=FiniteEnumeratedSets())
@@ -941,7 +946,7 @@ class Constellations_ld(UniqueRepresentation, Parent):
 
         self._connected = bool(connected)
 
-    def is_empty(self):
+    def is_empty(self) -> bool:
         r"""
         Return whether this set of constellations is empty.
 
@@ -956,7 +961,7 @@ class Constellations_ld(UniqueRepresentation, Parent):
         """
         return self._connected and self._length == 1 and self._degree > 1
 
-    def __contains__(self, elt):
+    def __contains__(self, elt) -> bool:
         r"""
         TESTS::
 
@@ -1023,17 +1028,6 @@ class Constellations_ld(UniqueRepresentation, Parent):
             Connected constellations of length 3 and degree 3 on {1, 2, 3}
             sage: len([v for v in const])
             26
-
-        One can check the first few terms of sequence :oeis:`220754`::
-
-            sage: Constellations(4,1).cardinality()
-            1
-            sage: Constellations(4,2).cardinality()
-            7
-            sage: Constellations(4,3).cardinality()
-            194
-            sage: Constellations(4,4).cardinality()  # long time
-            12858
         """
         from itertools import product
 
@@ -1048,6 +1042,37 @@ class Constellations_ld(UniqueRepresentation, Parent):
                 continue
             yield self(list(p) + [None], check=False)
 
+    def cardinality(self):
+        r"""
+        Return the cardinality of ``self``.
+
+        EXAMPLES:
+
+        One can check the first few terms of sequence :oeis:`A220754`::
+
+            sage: [Constellations(4, d).cardinality() for d in range(1, 6)]
+            [1, 7, 194, 12858, 1647384]
+
+            sage: [Constellations(3, d, connected=False).cardinality() for d in range(1, 6)]
+            [1, 4, 36, 576, 14400]
+        """
+        k = self._length
+        if not k:
+            return ZZ.one()
+
+        if not self._connected:
+            return factorial(self._degree) ** (k-1)
+
+        # recurrence from :oeis:`A220754`
+        a = []
+        for n in range(self._degree):
+            n = ZZ(n)
+            a.append(factorial(n+1) ** (k-1)
+                     - (factorial(n)
+                        * ZZ.sum(a[i] * factorial(n-i) ** (k-2) // factorial(i)
+                                 for i in range(n))))
+        return a[-1]
+
     def random_element(self, mutable=False):
         r"""
         Return a random element.
@@ -1057,7 +1082,7 @@ class Constellations_ld(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: const = Constellations(3,3)
+            sage: const = Constellations(3, 3)
             sage: const.random_element()
             Constellation of length 3 and degree 3
             ...
@@ -1070,15 +1095,17 @@ class Constellations_ld(UniqueRepresentation, Parent):
         from sage.groups.perm_gps.permgroup import PermutationGroup
 
         l = self._length
-        d = self._degree
         Sd = self._sym
 
-        g = [Sd.random_element() for _ in range(l - 1)]
-        G = PermutationGroup(g)
-        while not G.degree() == d or (self._connected and
-                                      not G.is_transitive()):
+        if self._connected:
+            d = self._degree
+            while True:
+                g = [Sd.random_element() for _ in range(l - 1)]
+                G = PermutationGroup(g)
+                if G.degree() == d and G.is_transitive():
+                    break
+        else:
             g = [Sd.random_element() for _ in range(l - 1)]
-            G = PermutationGroup(g)
 
         return self([sigma.domain() for sigma in g] + [None], mutable=mutable)
 

sage/combinat/crystals/affine_factorization.py

@@ -439,7 +439,8 @@ def affine_factorizations(w, l, weight=None):
             else:
                 return []
         else:
-            return [[u]+p for (u,v) in w.left_pieri_factorizations() for p in affine_factorizations(v,l-1) ]
+            return [[u] + p for u, v in w.left_pieri_factorizations()
+                    for p in affine_factorizations(v, l - 1)]
     else:
         if l != len(weight):
             return []
@@ -449,11 +450,11 @@ def affine_factorizations(w, l, weight=None):
             else:
                 return []
         else:
-            return [[u]+p for (u,v) in w.left_pieri_factorizations(max_length=weight[0]) if u.length() == weight[0]
-                    for p in affine_factorizations(v,l-1,weight[1:]) ]
+            return [[u] + p for u, v in w.left_pieri_factorizations(max_length=weight[0]) if u.length() == weight[0]
+                    for p in affine_factorizations(v, l - 1, weight[1:])]
 
 #####################################################################
-## Crystal isomorphisms
+#  Crystal isomorphisms
 
 
 class FactorizationToTableaux(CrystalMorphism):

sage/combinat/crystals/alcove_path.py

@@ -105,7 +105,7 @@ class CrystalOfAlcovePaths(UniqueRepresentation, Parent):
         ....:     })
         sage: G.is_isomorphic(GG)
         True
-        sage: for (u,v,i) in G.edges(sort=True):
+        sage: for u, v, i in G.edges(sort=True):
         ....:     print((u.integer_sequence() , v.integer_sequence(), i))
         ([], [0], 2)
         ([0], [0, 8], 1)
@@ -485,7 +485,7 @@ class CrystalOfAlcovePathsElement(ElementWrapper):
         """
         return iter(self.value)
 
-    def is_admissible(self):
+    def is_admissible(self) -> bool:
         r"""
         Diagnostic test to check if ``self`` is a valid element of the crystal.
 

sage/combinat/crystals/fully_commutative_stable_grothendieck.py

@@ -826,14 +826,15 @@ def _check_containment(t, parent):
         factors = len(t)
         max_value = parent.max_value
         from sage.monoids.hecke_monoid import HeckeMonoid
-        H = HeckeMonoid(SymmetricGroup(max_value+1))
+        H = HeckeMonoid(SymmetricGroup(max_value + 1))
         w = tuple(H.from_reduced_word(x for factor in t for x in factor).reduced_word())
         excess = sum(len(l) for l in t) - len(w)
 
     if factors != parent.factors:
         raise ValueError("number of factors do not match")
     if w != parent.w:
-            raise ValueError("self and parent must be specified based on equivalent words")
+        raise ValueError("self and parent must be specified based "
+                         "on equivalent words")
     if excess != parent.excess:
         raise ValueError("number of excess letters do not match")