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

sage/combinat/species/all.py

@@ -2,6 +2,67 @@
 r"""
 Combinatorial species
 
+A combinatorial species, as introduced by Joyal, is a functor from
+the category of finite sets with bijections to the category of finite
+sets with bijections.  Alternatively, we can regard a combinatorial
+species as a formal sum of group actions of the symmetric groups
+`\mathfrak S_n`, for `n\in\NN`.  For example, the trivial action of
+`\mathfrak S_n` corresponds to the species `\mathcal E_n` of sets of
+cardinality `n`.
+
+More generally, a weighted multisort species in `k` sorts is a
+functor from the category of `k`-tuples of finite sets with
+bijections to the category of weighted finite sets with
+weight-preserving bijections.  We may think of the sorts as
+variables, traditionally denoted by `X, Y, Z`.
+
+Such a species is equivalent to a formal sum of group actions of
+groups `\mathfrak S_{n_1} \times \cdots \times \mathfrak S_{n_k}` with
+`(n_1,\ldots,n_k)\in\NN^k`, together with a weight on the orbits of
+each group action.  Yet more generally, a virtual weighted multisort
+species is a formal difference of weighted multisort species.
+
+We regard a combinatorial species as a sequence of group actions of
+the symmetric groups `\mathfrak S_n`, for `n\in\NN`.
+
+Coefficients of lazy species are computed on demand.  They have
+infinite precision, although equality can only be decided in special
+cases.
+
+There are currently two implementations of combinatorial species, one
+of which is deprecated and will be removed once all of the
+functionality has been ported to the new framework.
+
+The recommended implementation is :ref:`sage.rings.lazy_species` and
+used as the following examples illustrate.
+
+EXAMPLES:
+
+We define rooted ordered trees with leaves having weight `q`::
+
+    sage: R.<q> = QQ[]
+    sage: L.<X> = LazyCombinatorialSpecies(R)
+    sage: leaf = X
+    sage: node = q * X
+    sage: linorder = X/(1 - X)
+    sage: T = L.undefined(valuation=1)
+    sage: T.define(leaf + node * linorder(T))
+    sage: T.isotype_generating_series()
+    X + q*X^2 + ((q^2+q)*X^3) + ((q^3+3*q^2+q)*X^4) + ((q^4+6*q^3+6*q^2+q)*X^5)
+    + ((q^5+10*q^4+20*q^3+10*q^2+q)*X^6) + O(X^7)
+
+We define rooted unordered trees with leaves of sort `Y`.  The
+standard representation of a species is its molecular decomposition::
+
+    sage: L = LazyCombinatorialSpecies(R, "X")
+    sage: E = L.Sets()
+    sage: Ep = E.restrict(1)
+    sage: M.<X, Y> = LazyCombinatorialSpecies(R)
+    sage: A = M.undefined(valuation=1)
+    sage: A.define(Y + X * Ep(A))
+    sage: A.truncate(5)
+    Y + X*Y + (X^2*Y+X*E_2(Y)) + (X^3*Y+X^2*E_2(Y)+X^2*Y^2+X*E_3(Y))
+
 Introductory material
 ---------------------
 
@@ -36,13 +97,17 @@ Miscellaneous
 
 - :ref:`sage.combinat.species.structure`
 - :ref:`sage.combinat.species.misc`
+
 """
 # install the docstring of this module to the containing package
 from sage.misc.namespace_package import install_doc
 install_doc(__package__, __doc__)
 
 from sage.misc.lazy_import import lazy_import
-lazy_import("sage.combinat.species.recursive_species", "CombinatorialSpecies")
-lazy_import("sage.combinat.species", "library", as_='species')
+lazy_import("sage.combinat.species.recursive_species", "CombinatorialSpecies",
+            deprecation=(38544, "combinat.species is superseded by LazyCombinatorialSpecies"))
+
+lazy_import("sage.combinat.species", "library", as_='species',
+            deprecation=(38544, "combinat.species is superseded by LazyCombinatorialSpecies"))
 del lazy_import
 del install_doc

sage/combinat/species/characteristic_species.py

@@ -30,6 +30,9 @@ class CharacteristicSpeciesStructure(GenericSpeciesStructure):
         EXAMPLES::
 
             sage: F = species.CharacteristicSpecies(3)
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: a = F.structures([1, 2, 3]).random_element(); a
             {1, 2, 3}
             sage: F = species.SingletonSpecies()

sage/combinat/species/composition_species.py

@@ -28,6 +28,9 @@ class CompositionSpeciesStructure(GenericSpeciesStructure):
         TESTS::
 
             sage: E = species.SetSpecies(); C = species.CycleSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: L = E(C)
             sage: a = L.structures(['a','b','c']).random_element()                      # needs sage.libs.flint
             sage: a == loads(dumps(a))                                                  # needs sage.libs.flint

sage/combinat/species/cycle_species.py

@@ -26,6 +26,10 @@ class CycleSpeciesStructure(GenericSpeciesStructure):
         EXAMPLES::
 
             sage: S = species.CycleSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
+
             sage: S.structures(["a","b","c"])[0]
             ('a', 'b', 'c')
         """

sage/combinat/species/empty_species.py

@@ -28,6 +28,9 @@ class EmptySpecies(GenericCombinatorialSpecies, UniqueRepresentation):
     EXAMPLES::
 
         sage: X = species.EmptySpecies(); X
+        doctest:warning...
+        DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+        See https://github.com/sagemath/sage/issues/38544 for details.
         Empty species
         sage: X.structures([]).list()
         []

sage/combinat/species/functorial_composition_species.py

@@ -32,6 +32,9 @@ class FunctorialCompositionSpecies(GenericCombinatorialSpecies):
         EXAMPLES::
 
             sage: E = species.SetSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: E2 = species.SetSpecies(size=2)
             sage: WP = species.SubsetSpecies()
             sage: P2 = E2*E

sage/combinat/species/generating_series.py

@@ -217,6 +217,9 @@ class ExponentialGeneratingSeries(LazyPowerSeries):
         EXAMPLES::
 
             sage: G = species.SimpleGraphSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: g = G.generating_series()
             sage: [g.coefficient(i) for i in range(10)]
             [1, 1, 1, 4/3, 8/3, 128/15, 2048/45, 131072/315, 2097152/315, 536870912/2835]

sage/combinat/species/library.py

@@ -42,6 +42,9 @@ def SimpleGraphSpecies():
     EXAMPLES::
 
         sage: S = species.SimpleGraphSpecies()
+        doctest:warning...
+        DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+        See https://github.com/sagemath/sage/issues/38544 for details.
         sage: S.generating_series().counts(10)
         [1, 1, 2, 8, 64, 1024, 32768, 2097152, 268435456, 68719476736]
         sage: S.cycle_index_series()[:5]                                                # needs sage.libs.pari sage.modules

sage/combinat/species/linear_order_species.py

@@ -28,6 +28,9 @@ class LinearOrderSpeciesStructure(GenericSpeciesStructure):
         EXAMPLES::
 
             sage: P = species.LinearOrderSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: s = P.structures(["a", "b", "c"]).random_element()
             sage: s.canonical_label()
             ['a', 'b', 'c']

sage/combinat/species/partition_species.py

@@ -34,6 +34,9 @@ class PartitionSpeciesStructure(GenericSpeciesStructure):
 
             sage: from sage.combinat.species.partition_species import PartitionSpeciesStructure
             sage: P = species.PartitionSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: s = PartitionSpeciesStructure(P, ['a','b','c'], [[1,2],[3]]); s
             {{'a', 'b'}, {'c'}}
             sage: s == loads(dumps(s))

sage/combinat/species/permutation_species.py

@@ -31,6 +31,10 @@ class PermutationSpeciesStructure(GenericSpeciesStructure):
         EXAMPLES::
 
             sage: P = species.PermutationSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
+
             sage: S = P.structures(["a", "b", "c"])
             sage: [s.canonical_label() for s in S]
             [['a', 'b', 'c'],

sage/combinat/species/product_species.py

@@ -28,6 +28,9 @@ class ProductSpeciesStructure(GenericSpeciesStructure):
         TESTS::
 
             sage: S = species.SetSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: F = S * S
             sage: a = F.structures(['a','b','c']).random_element()
             sage: a == loads(dumps(a))

sage/combinat/species/recursive_species.py

@@ -31,6 +31,9 @@ class CombinatorialSpecies(GenericCombinatorialSpecies):
         EXAMPLES::
 
             sage: F = CombinatorialSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: loads(dumps(F))
             Combinatorial species
 

sage/combinat/species/set_species.py

@@ -30,6 +30,9 @@ class SetSpeciesStructure(GenericSpeciesStructure):
         EXAMPLES::
 
             sage: S = species.SetSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: a = S.structures(["a","b","c"]).random_element(); a
             {'a', 'b', 'c'}
         """

sage/combinat/species/species.py

@@ -21,6 +21,9 @@ leaves and of `q` to internal nodes::
 
     sage: q = QQ['q'].gen()
     sage: leaf = species.SingletonSpecies()
+    doctest:warning...
+    DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+    See https://github.com/sagemath/sage/issues/38544 for details.
     sage: internal_node = species.SingletonSpecies(weight=q)
     sage: L = species.LinearOrderSpecies(min=1)
     sage: T = species.CombinatorialSpecies(min=1)
@@ -140,6 +143,9 @@ class GenericCombinatorialSpecies(SageObject):
             sage: X = species.SingletonSpecies()
             sage: E = species.EmptySetSpecies()
             sage: L = CombinatorialSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: L.define(E+X*L)
             sage: K = CombinatorialSpecies()
             sage: K.define(E+X*L)
@@ -177,7 +183,7 @@ class GenericCombinatorialSpecies(SageObject):
         """
         return not (self == other)
 
-    def __getstate__(self):
+    def _getstate_(self):
         r"""
         This is used during the pickling process and returns a dictionary
         of the data needed to create this object during the unpickling
@@ -189,7 +195,7 @@ class GenericCombinatorialSpecies(SageObject):
         EXAMPLES::
 
             sage: C = species.CharacteristicSpecies(5)
-            sage: args, kwds = C.__getstate__()
+            sage: args, kwds = C._getstate_()
             sage: args
             {0: 5}
             sage: sorted(kwds.items())
@@ -201,10 +207,10 @@ class GenericCombinatorialSpecies(SageObject):
         except AttributeError:
             return ({}, kwds)
 
-    def __setstate__(self, state):
+    def _setstate_(self, state):
         """
         This is used during unpickling to recreate this object from the
-        data provided by the ``__getstate__`` method.
+        data provided by the ``_getstate_`` method.
 
         TESTS::
 
@@ -212,7 +218,7 @@ class GenericCombinatorialSpecies(SageObject):
             sage: C4 = species.CharacteristicSpecies(4)
             sage: C2
             Characteristic species of order 2
-            sage: C2.__setstate__(C4.__getstate__()); C2
+            sage: C2._setstate_(C4._getstate_()); C2
             Characteristic species of order 4
         """
         args_dict, kwds = state
@@ -230,7 +236,7 @@ class GenericCombinatorialSpecies(SageObject):
             sage: C.weighted(t)
             Cyclic permutation species with weight=t
         """
-        args_dict, kwds = self.__getstate__()
+        args_dict, kwds = self._getstate_()
         kwds.update({'weight': weight})
         return self.__class__(*[args_dict[i] for i in range(len(args_dict))], **kwds)
 
@@ -796,7 +802,7 @@ class GenericCombinatorialSpecies(SageObject):
         Qz = QQ['z'].fraction_field()
 
         # Generate the variable names and the corresponding polynomial rings
-        var_names = ["node%s" % i for i in range(d.num_verts())]
+        var_names = ["node%s" % i for i in range(d.n_vertices())]
         R = Qz[", ".join(var_names)]
         R_gens_dict = R.gens_dict()
 

sage/combinat/species/structure.py

@@ -14,6 +14,9 @@ BB = o + o\*BB + o\*|\*BB
 Here we define this species using the default structures::
 
     sage: ball = species.SingletonSpecies()
+    doctest:warning...
+    DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+    See https://github.com/sagemath/sage/issues/38544 for details.
     sage: bar = species.EmptySetSpecies()
     sage: BB = CombinatorialSpecies()
     sage: BB.define(ball + ball*BB + ball*bar*BB)
@@ -180,11 +183,10 @@ class GenericSpeciesStructure(CombinatorialObject):
             [1, 2, 3]
         """
         if isinstance(i, (int, Integer)):
-            return self._labels[i-1]
-        else:
-            return i
+            return self._labels[i - 1]
+        return i
 
-    def is_isomorphic(self, x):
+    def is_isomorphic(self, x) -> bool:
         """
         EXAMPLES::
 
@@ -201,11 +203,8 @@ class GenericSpeciesStructure(CombinatorialObject):
         if self.parent() != x.parent():
             return False
 
-        #We don't care about the labels for isomorphism testing
-        if self.canonical_label()._list == x.canonical_label()._list:
-            return True
-        else:
-            return False
+        # We don't care about the labels for isomorphism testing
+        return self.canonical_label()._list == x.canonical_label()._list
 
 
 #For backward compatibility.  This should be removed in the near

sage/combinat/species/subset_species.py

@@ -33,6 +33,9 @@ class SubsetSpeciesStructure(GenericSpeciesStructure):
 
             sage: set_random_seed(0)
             sage: S = species.SubsetSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: a = S.structures(["a","b","c"])[0]; a
             {}
         """

sage/combinat/species/sum_species.py

@@ -33,6 +33,9 @@ class SumSpecies(GenericCombinatorialSpecies, UniqueRepresentation):
         EXAMPLES::
 
             sage: S = species.PermutationSpecies()
+            doctest:warning...
+            DeprecationWarning: combinat.species is superseded by LazyCombinatorialSpecies
+            See https://github.com/sagemath/sage/issues/38544 for details.
             sage: A = S+S
             sage: A.generating_series()[:5]
             [2, 2, 2, 2, 2]

sage/combinat/subword.py

@@ -56,7 +56,6 @@ AUTHORS:
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 from __future__ import annotations
-from collections.abc import Iterator
 import itertools
 
 from sage.structure.parent import Parent
@@ -66,6 +65,10 @@ from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 import sage.misc.prandom as prandom
 from sage.rings.integer import Integer
 from sage.sets.finite_enumerated_set import FiniteEnumeratedSet
+from typing import TYPE_CHECKING
+
+if TYPE_CHECKING:
+    from collections.abc import Iterator
 
 
 def _stringification(data):

sage/combinat/subword_complex.py

@@ -350,7 +350,7 @@ class SubwordComplexFacet(Simplex, Element):
         Phi = self.parent().group().roots()
         return [Phi[i] for i in self._root_configuration_indices()]
 
-    def kappa_preimage(self):
+    def kappa_preimage(self) -> list:
         r"""
         Return the fiber of ``self`` under the `\kappa` map.
 
@@ -404,7 +404,7 @@ class SubwordComplexFacet(Simplex, Element):
                 if all(w.action_on_root_indices(i, side='left') < N
                        for i in root_conf)]
 
-    def is_vertex(self):
+    def is_vertex(self) -> bool:
         r"""
         Return ``True`` if ``self`` is a vertex of the brick polytope
         of ``self.parent``.
@@ -1446,7 +1446,7 @@ class SubwordComplex(UniqueRepresentation, SimplicialComplex):
 
     # topological properties
 
-    def is_sphere(self):
+    def is_sphere(self) -> bool:
         r"""
         Return ``True`` if the subword complex ``self`` is a sphere.
 
@@ -1473,7 +1473,7 @@ class SubwordComplex(UniqueRepresentation, SimplicialComplex):
         w = W.demazure_product(self._Q)
         return w == self._pi
 
-    def is_ball(self):
+    def is_ball(self) -> bool:
         r"""
         Return ``True`` if the subword complex ``self`` is a ball.
 
@@ -1500,7 +1500,7 @@ class SubwordComplex(UniqueRepresentation, SimplicialComplex):
         """
         return not self.is_sphere()
 
-    def is_pure(self):
+    def is_pure(self) -> bool:
         r"""
         Return ``True`` since all subword complexes are pure.
 
@@ -1542,7 +1542,7 @@ class SubwordComplex(UniqueRepresentation, SimplicialComplex):
     # root and weight
 
     @cached_method
-    def is_root_independent(self):
+    def is_root_independent(self) -> bool:
         r"""
         Return ``True`` if ``self`` is root-independent.
 
@@ -1570,7 +1570,7 @@ class SubwordComplex(UniqueRepresentation, SimplicialComplex):
         return M.rank() == max(M.ncols(), M.nrows())
 
     @cached_method
-    def is_double_root_free(self):
+    def is_double_root_free(self) -> bool:
         r"""
         Return ``True`` if ``self`` is double-root-free.
 

sage/combinat/superpartition.py

@@ -558,7 +558,7 @@ class SuperPartition(ClonableArray,
         """
         sd = self.to_circled_diagram()
         return SuperPartition.from_circled_diagram(sd[0].conjugate(),
-                                                   [(j, i) for (i, j) in sd[1]])
+                                                   [(j, i) for i, j in sd[1]])
 
     def zee(self) -> Integer:
         r"""

sage/combinat/symmetric_group_algebra.py

@@ -120,7 +120,7 @@ def SymmetricGroupAlgebra(R, W, category=None):
         Weyl Group of type ['A', 3] (as a matrix group acting
         on the ambient space)
         sage: SGA.an_element()
-        s1*s2*s3 + 3*s2*s3*s1*s2 + 2*s3*s1 + 1
+        s1*s2*s3 + ... + 1
 
     The preferred way to construct the symmetric group algebra is to
     go through the usual ``algebra`` method::
@@ -1314,6 +1314,7 @@ class SymmetricGroupAlgebra_n(GroupAlgebra_class):
         modules (which are the :meth:`Specht modules <specht_module>`
         and also projective modules)::
 
+            sage: # long time
             sage: SGA = SymmetricGroupAlgebra(QQ, 5)
             sage: for la in Partitions(SGA.n):
             ....:     idem = SGA.ladder_idempotent(la)
@@ -2176,7 +2177,6 @@ class SymmetricGroupAlgebra_n(GroupAlgebra_class):
             ...
             NotImplementedError: not implemented when p|n!; dimension of invariant forms may be greater than one
         """
-        from sage.matrix.special import diagonal_matrix
         F = self.base_ring()
         G = self.group()
 
@@ -2209,9 +2209,9 @@ class SymmetricGroupAlgebra_n(GroupAlgebra_class):
                 return F.zero()
             z = F.multiplicative_generator()
             k = u.log(z)
-            if k % (q+1) != 0:
+            if k % (q + 1) != 0:
                 raise ValueError(f"unable to factor as {u} is not in base field GF({q})")
-            return z ** ((k//(q+1)) % (q-1))
+            return z ** ((k // (q + 1)) % (q - 1))
 
         dft_matrix = self.dft()
         n = dft_matrix.nrows()
@@ -2536,7 +2536,7 @@ class SymmetricGroupAlgebra_n(GroupAlgebra_class):
         T = []
         total = 1  # make it 1-based
         for r in la:
-            T.append(list(range(total, total+r)))
+            T.append(list(range(total, total + r)))
             total += r
         T = Tableau(T)
         G = self.group()
@@ -2634,7 +2634,7 @@ class SymmetricGroupAlgebra_n(GroupAlgebra_class):
             self._cellular_KL = KazhdanLusztigPolynomial(self._KLG, q)
             polyfunc = self._cellular_KL.P
         else:
-            self._cellular_KL = Coxeter3Group(['A', self.n+1])
+            self._cellular_KL = Coxeter3Group(['A', self.n + 1])
             self._KLG = self._cellular_KL
             polyfunc = self._cellular_KL.kazhdan_lusztig_polynomial
 
@@ -3565,9 +3565,9 @@ class HeckeAlgebraSymmetricGroup_generic(CombinatorialFreeModule):
         if x in Permutations():
             if len(x) < self.n:
                 return self.monomial(self._indices(
-                            list(x) + list(range(len(x) + 1, self.n + 1))
-                        ))
-            if all(x[i] == i+1 for i in range(self.n, len(x))):
+                    list(x) + list(range(len(x) + 1, self.n + 1))
+                ))
+            if all(x[i] == i + 1 for i in range(self.n, len(x))):
                 return self.monomial(self._indices(x[:self.n]))
 
         return self._indices(x)

sage/combinat/symmetric_group_representations.py

@@ -683,10 +683,10 @@ class YoungRepresentation_generic(SymmetricGroupRepresentation_generic_class):
         digraph = copy(Y._digraph)
         digraph.delete_edges((u, v) for (u, v, (j, beta)) in digraph.edges(sort=True)
                              if j != i)
-        M = matrix(self._ring, digraph.num_verts())
+        M = matrix(self._ring, digraph.n_vertices())
         for g in digraph.connected_components_subgraphs():
-            if g.num_verts() == 1:
-                [v] = g.vertices(sort=True)
+            if g.n_vertices() == 1:
+                v, = g.vertices(sort=True)
                 w = self._word_dict[v]
                 trivial = None
                 for j, a in enumerate(w):
@@ -699,7 +699,7 @@ class YoungRepresentation_generic(SymmetricGroupRepresentation_generic_class):
                 j = index_lookup[v]
                 M[j, j] = 1 if trivial is True else -1
             else:
-                [(u, v, (j, beta))] = g.edges(sort=True)
+                (u, v, (j, beta)), = g.edges(sort=True)
                 iu = index_lookup[u]
                 iv = index_lookup[v]
                 M[iu, iu], M[iu, iv], M[iv, iu], M[iv, iv] = \
@@ -732,7 +732,7 @@ class YoungRepresentation_generic(SymmetricGroupRepresentation_generic_class):
             [-1/2  3/2]
             [ 1/2  1/2]
         """
-        m = self._yang_baxter_graph._digraph.num_verts()
+        m = self._yang_baxter_graph._digraph.n_vertices()
         M = matrix(self._ring, m, m, 1)
         for i in Permutation(permutation).reduced_word():
             M *= self.representation_matrix_for_simple_transposition(i)

sage/combinat/t_sequences.py

@@ -357,15 +357,15 @@ def T_sequences_construction_from_base_sequences(base_sequences, check=True):
 
     A, B, C, D = base_sequences
     n = len(C)
-    p = len(A)-n
+    p = len(A) - n
 
-    assert len(A) == len(B) == len(C)+p == len(D)+p
+    assert len(A) == len(B) == len(C) + p == len(D) + p
 
     def seq_sum(seq1, seq2):
-        return [(a+b)//2 for (a, b) in zip(seq1, seq2)]
+        return [(a + b) // 2 for a, b in zip(seq1, seq2)]
 
     def seq_subtract(seq1, seq2):
-        return [(a-b)//2 for (a, b) in zip(seq1, seq2)]
+        return [(a - b) // 2 for a, b in zip(seq1, seq2)]
 
     def zero_seq(n):
         return [0 for _ in range(n)]

sage/combinat/tableau.py

@@ -7041,6 +7041,8 @@ class SemistandardTableaux_shape_weight(SemistandardTableaux_shape):
         """
         return symmetrica.kostka_tab(self.shape, self.weight)
 
+    random_element = FiniteEnumeratedSets.ParentMethods._random_element_from_unrank
+
 
 class SemistandardTableaux_size_weight(SemistandardTableaux):
     r"""
@@ -9345,10 +9347,7 @@ class IncreasingTableaux_shape_weight(IncreasingTableaux_shape):
             for i in row:
                 content_list[i-1] = 1
 
-        if tuple(content_list) != self.weight:
-            return False
-
-        return True
+        return tuple(content_list) == self.weight
 
     def __iter__(self):
         """

sage/combinat/tableau_tuple.py

@@ -208,7 +208,7 @@ subsequent papers on the representation theory of these algebras.
 # 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.arith.misc import factorial
@@ -5078,7 +5078,7 @@ class StandardTableaux_residue(StandardTableauTuples):
             sage: T = StandardTableauTuple([[[6],[7]],[[1,2,3],[4,5]]]).residue_sequence(2,(0,0)).standard_tableaux()
             sage: TestSuite(T).run()
         """
-        super().__init__(residue, category=FiniteEnumeratedSets())
+        super().__init__(category=FiniteEnumeratedSets())
         self._level = residue.level()
         self._multicharge = residue.multicharge()
         self._quantum_characteristic = residue.quantum_characteristic()