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

{passagemath_combinat-10.6.1.dist-info → passagemath_combinat-10.8.1a1.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (80.9.0)
+Generator: setuptools (80.10.1)
 Root-Is-Purelib: false
 Tag: cp312-cp312-musllinux_1_2_aarch64
 

passagemath_combinat-10.8.1a1.dist-info/top_level.txt

@@ -0,0 +1,3 @@
+
+passagemath_combinat
+sage

sage/algebras/affine_nil_temperley_lieb.py

@@ -114,7 +114,7 @@ class AffineNilTemperleyLiebTypeA(CombinatorialFreeModule):
         """
         return self.weyl_group().one()
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         EXAMPLES::
 
@@ -222,7 +222,7 @@ class AffineNilTemperleyLiebTypeA(CombinatorialFreeModule):
 
             sage: A = AffineNilTemperleyLiebTypeA(5)
             sage: W = A.weyl_group()
-            sage: s=W.simple_reflections()
+            sage: s = W.simple_reflections()
             sage: A.has_no_braid_relation(s[2]*s[1]*s[0]*s[4]*s[3],0)
             False
             sage: A.has_no_braid_relation(s[2]*s[1]*s[0]*s[4]*s[3],2)
@@ -243,7 +243,7 @@ class AffineNilTemperleyLiebTypeA(CombinatorialFreeModule):
                 return j not in wi.descents()
         return self.has_no_braid_relation(w * s[w.first_descent()], i)
 
-    def _repr_term(self, t, short_display=True):
+    def _repr_term(self, t, short_display=True) -> str:
         """
         EXAMPLES::
 

sage/algebras/all.py

@@ -21,5 +21,4 @@ from sage.algebras.all__sagemath_modules import *
 from sage.algebras.all__sagemath_singular import *
 from sage.algebras.all__sagemath_combinat import *
 
-from sage.algebras.fusion_rings.all import *
 from sage.algebras.lie_conformal_algebras.all import *

sage/algebras/askey_wilson.py

@@ -312,7 +312,7 @@ class AskeyWilsonAlgebra(CombinatorialFreeModule):
         var_names = ['A', 'B', 'C', '\\alpha', '\\beta', '\\gamma']
         return ''.join(exp(l, e) for l, e in zip(var_names, t))
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 

sage/algebras/associated_graded.py

@@ -197,7 +197,7 @@ class AssociatedGradedAlgebra(CombinatorialFreeModule):
         phi = self.module_morphism(diagonal=lambda x: base_one, codomain=A)
         self._A.register_conversion(phi)
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -214,7 +214,7 @@ class AssociatedGradedAlgebra(CombinatorialFreeModule):
             return "Graded Algebra of {}".format(self._A)
         return "Graded Module of {}".format(self._A)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.
 

sage/algebras/cellular_basis.py

@@ -109,10 +109,7 @@ REFERENCES:
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-try:
-    from typing import Self  # type: ignore (Python >= 3.11)
-except ImportError:
-    from typing_extensions import Self  # type: ignore (Python 3.10)
+from typing import Self
 
 from sage.categories.algebras import Algebras
 from sage.combinat.free_module import CombinatorialFreeModule
@@ -211,7 +208,7 @@ class CellularBasis(CombinatorialFreeModule):
         to_cellular.register_as_coercion()
         from_cellular.register_as_coercion()
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         String representation of ``self``.
 
@@ -223,7 +220,7 @@ class CellularBasis(CombinatorialFreeModule):
         """
         return "Cellular basis of {}".format(self._algebra)
 
-    def _latex_term(self, x):
+    def _latex_term(self, x) -> str:
         r"""
         Return a latex representation of the term indexed by ``x``.
 

sage/algebras/cluster_algebra.py

@@ -1989,8 +1989,7 @@ class ClusterAlgebra(Parent, UniqueRepresentation):
                 msg += "you can compute it by mutating from the initial seed along the sequence "
                 msg += str(self._path_dict[g_vector])
                 raise KeyError(msg)
-            else:
-                raise KeyError("the g-vector %s has not been found yet" % str(g_vector))
+            raise KeyError("the g-vector {} has not been found yet".format(g_vector))
 
     def find_g_vector(self, g_vector, depth=infinity):
         r"""
@@ -2630,7 +2629,7 @@ class ClusterAlgebra(Parent, UniqueRepresentation):
         g_vector = tuple(g_vector)
         F = self.theta_basis_F_polynomial(g_vector).subs(self._yhat)
         g_mon = prod(self.ambient().gen(i) ** g_vector[i] for i in range(self.rank()))
-        # we only return the monomal g_mon times the evaluated F-polynomial because this is how
+        # we only return the monomial g_mon times the evaluated F-polynomial because this is how
         # theta basis elements behave.
         return self.retract(g_mon * F)
 

sage/algebras/down_up_algebra.py

@@ -216,7 +216,7 @@ class DownUpAlgebra(CombinatorialFreeModule):
         CombinatorialFreeModule.__init__(self, base_ring, indices, category=cat, sorting_reverse=True)
         self._assign_names(['d', 'u'])
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 
@@ -229,7 +229,7 @@ class DownUpAlgebra(CombinatorialFreeModule):
         return "Down-Up algebra with parameters ({}, {}, {}) over {}".format(
             self._alpha, self._beta, self._gamma, self.base_ring())
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.
 
@@ -242,7 +242,7 @@ class DownUpAlgebra(CombinatorialFreeModule):
         """
         return "\\mathcal{DU}(%s,%s,%s)" % (self._alpha, self._beta, self._gamma)
 
-    def _repr_term(self, m):
+    def _repr_term(self, m) -> str:
         r"""
         Return a string representation of the basis element indexed by ``m``.
 
@@ -274,7 +274,7 @@ class DownUpAlgebra(CombinatorialFreeModule):
                 ret += f"{s}^{m[i]}"
         return ret
 
-    def _latex_term(self, m):
+    def _latex_term(self, m) -> str:
         r"""
         Return a latex representation for the basis element indexed by ``m``.
 
@@ -623,7 +623,7 @@ class VermaModule(CombinatorialFreeModule):
         CombinatorialFreeModule.__init__(self, R, NonNegativeIntegers(),
                                          prefix='v', category=cat)
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 
@@ -635,7 +635,7 @@ class VermaModule(CombinatorialFreeModule):
         """
         return f"Verma module of weight {self._weights[0]} of {self._DU}"
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.
 

sage/algebras/free_algebra.py

@@ -160,7 +160,6 @@ Some tests for the category::
 #                  https://www.gnu.org/licenses/
 # ***************************************************************************
 
-
 from sage.algebras.free_algebra_element import FreeAlgebraElement
 from sage.categories.algebras_with_basis import AlgebrasWithBasis
 from sage.categories.functor import Functor
@@ -377,34 +376,6 @@ class FreeAlgebraFactory(UniqueFactory):
 FreeAlgebra = FreeAlgebraFactory('FreeAlgebra')
 
 
-def is_FreeAlgebra(x) -> bool:
-    """
-    Return ``True`` if x is a free algebra; otherwise, return ``False``.
-
-    EXAMPLES::
-
-        sage: from sage.algebras.free_algebra import is_FreeAlgebra
-        sage: is_FreeAlgebra(5)
-        doctest:warning...
-        DeprecationWarning: the function is_FreeAlgebra is deprecated;
-        use 'isinstance(..., (FreeAlgebra_generic, FreeAlgebra_letterplace))' instead
-        See https://github.com/sagemath/sage/issues/37896 for details.
-        False
-        sage: is_FreeAlgebra(ZZ)
-        False
-        sage: is_FreeAlgebra(FreeAlgebra(ZZ,100,'x'))
-        True
-        sage: is_FreeAlgebra(FreeAlgebra(ZZ,10,'x',implementation='letterplace'))       # needs sage.libs.singular
-        True
-        sage: is_FreeAlgebra(FreeAlgebra(ZZ,10,'x',implementation='letterplace',        # needs sage.libs.singular
-        ....:                            degrees=list(range(1,11))))
-        True
-    """
-    from sage.misc.superseded import deprecation
-    deprecation(37896, "the function is_FreeAlgebra is deprecated; use 'isinstance(..., (FreeAlgebra_generic, FreeAlgebra_letterplace))' instead")
-    return isinstance(x, (FreeAlgebra_generic, FreeAlgebra_letterplace))
-
-
 class FreeAlgebra_generic(CombinatorialFreeModule):
     """
     The free algebra on `n` generators over a base ring.
@@ -471,7 +442,7 @@ class FreeAlgebra_generic(CombinatorialFreeModule):
     """
     Element = FreeAlgebraElement
 
-    def __init__(self, R, n, names, degrees=None):
+    def __init__(self, R, n, names, degrees=None) -> None:
         """
         The free algebra on `n` generators over a base ring.
 
@@ -1246,7 +1217,7 @@ class PBWBasisOfFreeAlgebra(CombinatorialFreeModule):
                                          category=category)
         self._assign_names(alg.variable_names())
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -1257,7 +1228,7 @@ class PBWBasisOfFreeAlgebra(CombinatorialFreeModule):
         """
         return "The Poincare-Birkhoff-Witt basis of {}".format(self._alg)
 
-    def _repr_term(self, w):
+    def _repr_term(self, w) -> str:
         """
         Return a representation of term indexed by ``w``.
 

sage/algebras/free_algebra_element.py

@@ -19,8 +19,7 @@ TESTS::
     sage: (x*y)^3
     x*y*x*y*x*y
 """
-
-#*****************************************************************************
+# ***************************************************************************
 #  Copyright (C) 2005 David Kohel <kohel@maths.usyd.edu>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -32,8 +31,8 @@ TESTS::
 #  See the GNU General Public License for more details; the full text
 #  is available at:
 #
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ***************************************************************************
 
 from sage.misc.repr import repr_lincomb
 from sage.monoids.free_monoid_element import FreeMonoidElement
@@ -57,7 +56,7 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         sage: y * x < x * y
         False
     """
-    def __init__(self, A, x):
+    def __init__(self, A, x) -> None:
         """
         Create the element ``x`` of the FreeAlgebra ``A``.
 
@@ -69,7 +68,7 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         """
         if isinstance(x, FreeAlgebraElement):
             # We should have an input for when we know we don't need to
-            #   convert the keys/values
+            # convert the keys/values
             x = x._monomial_coefficients
         R = A.base_ring()
         if isinstance(x, AlgebraElement):  # and x.parent() == A.base_ring():
@@ -83,7 +82,7 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
 
         IndexedFreeModuleElement.__init__(self, A, x)
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return string representation of ``self``.
 
@@ -105,10 +104,9 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         M = P.monoid()
         from sage.structure.parent_gens import localvars
         with localvars(M, P.variable_names(), normalize=False):
-            x = repr_lincomb(v, strip_one=True)
-        return x
+            return repr_lincomb(v, strip_one=True)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return latex representation of ``self``.
 
@@ -133,7 +131,7 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
             7
             sage: (2*x+y).subs({x:1,y:z})
             2 + z
-            sage: f=x+3*y+z
+            sage: f = x+3*y+z
             sage: f(1,2,1/2)
             15/2
             sage: f(1,2)
@@ -159,7 +157,8 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
                         pass
                 return None
 
-            x = [extract_from(kwds,(p.gen(i),p.variable_name(i))) for i in range(p.ngens())]
+            x = [extract_from(kwds, (p.gen(i), p.variable_name(i)))
+                 for i in range(p.ngens())]
         elif isinstance(x[0], tuple):
             x = x[0]
 
@@ -171,9 +170,9 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         result = None
         for m, c in self._monomial_coefficients.items():
             if result is None:
-                result = c*m(x)
+                result = c * m(x)
             else:
-                result += c*m(x)
+                result += c * m(x)
 
         if result is None:
             return self.parent().zero()
@@ -181,8 +180,9 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
 
     def _mul_(self, y):
         """
-        Return the product of ``self`` and ``y`` (another free algebra
-        element with the same parent).
+        Return the product of ``self`` and ``y``.
+
+        This is another free algebra element with the same parent.
 
         EXAMPLES::
 
@@ -194,16 +194,16 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         z_elt = {}
         for mx, cx in self:
             for my, cy in y:
-                key = mx*my
+                key = mx * my
                 if key in z_elt:
-                    z_elt[key] += cx*cy
+                    z_elt[key] += cx * cy
                 else:
-                    z_elt[key] = cx*cy
+                    z_elt[key] = cx * cy
                 if not z_elt[key]:
                     del z_elt[key]
         return A._from_dict(z_elt)
 
-    def is_unit(self):
+    def is_unit(self) -> bool:
         r"""
         Return ``True`` if ``self`` is invertible.
 
@@ -276,10 +276,6 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
             return scalar * Factorization([(self, 1)])
         return super()._acted_upon_(scalar, self_on_left)
 
-    # For backward compatibility
-    # _lmul_ = _acted_upon_
-    # _rmul_ = _acted_upon_
-
     def _im_gens_(self, codomain, im_gens, base_map):
         """
         Apply a morphism defined by its values on the generators.
@@ -306,7 +302,7 @@ class FreeAlgebraElement(IndexedFreeModuleElement, AlgebraElement):
         return codomain.sum(base_map(c) * m(*im_gens)
                             for m, c in self._monomial_coefficients.items())
 
-    def variables(self):
+    def variables(self) -> list:
         """
         Return the variables used in ``self``.
 

sage/algebras/free_algebra_quotient_element.py

@@ -4,11 +4,11 @@
 Free algebra quotient elements
 
 AUTHORS:
-    - William Stein (2011-11-19): improved doctest coverage to 100%
-    - David Kohel (2005-09): initial version
-"""
 
-#*****************************************************************************
+- William Stein (2011-11-19): improved doctest coverage to 100%
+- David Kohel (2005-09): initial version
+"""
+# ***************************************************************************
 #  Copyright (C) 2005 David Kohel <kohel@maths.usyd.edu>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -20,9 +20,8 @@ AUTHORS:
 #  See the GNU General Public License for more details; the full text
 #  is available at:
 #
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
-
+#                  https://www.gnu.org/licenses/
+# ***************************************************************************
 from sage.misc.repr import repr_lincomb
 from sage.structure.element import RingElement, AlgebraElement
 from sage.structure.parent_gens import localvars
@@ -33,36 +32,8 @@ from sage.monoids.free_monoid_element import FreeMonoidElement
 from sage.algebras.free_algebra_element import FreeAlgebraElement
 
 
-def is_FreeAlgebraQuotientElement(x):
-    """
-    EXAMPLES::
-
-        sage: from sage.algebras.free_algebra_quotient import hamilton_quatalg
-        sage: from sage.algebras.free_algebra_quotient_element import is_FreeAlgebraQuotientElement
-        sage: H, (i,j,k) = hamilton_quatalg(QQ)
-        sage: is_FreeAlgebraQuotientElement(i)
-        doctest:warning...
-        DeprecationWarning: The function is_FreeAlgebraQuotientElement is deprecated;
-        use 'isinstance(..., FreeAlgebraQuotientElement)' instead.
-        See https://github.com/sagemath/sage/issues/38184 for details.
-        True
-
-    Of course this is testing the data type::
-
-        sage: is_FreeAlgebraQuotientElement(1)
-        False
-        sage: is_FreeAlgebraQuotientElement(H(1))
-        True
-    """
-    from sage.misc.superseded import deprecation
-    deprecation(38184,
-                "The function is_FreeAlgebraQuotientElement is deprecated; "
-                "use 'isinstance(..., FreeAlgebraQuotientElement)' instead.")
-    return isinstance(x, FreeAlgebraQuotientElement)
-
-
 class FreeAlgebraQuotientElement(AlgebraElement):
-    def __init__(self, A, x):
+    def __init__(self, A, x) -> None:
         """
         Create the element x of the FreeAlgebraQuotient A.
 
@@ -130,7 +101,7 @@ class FreeAlgebraQuotientElement(AlgebraElement):
         else:
             raise TypeError("argument x (= %s) is of the wrong type" % x)
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         EXAMPLES::
 
@@ -145,7 +116,7 @@ class FreeAlgebraQuotientElement(AlgebraElement):
             mons = Q.monomial_basis()
             return repr_lincomb(zip(mons, cffs), strip_one=True)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         EXAMPLES::
 

sage/algebras/free_zinbiel_algebra.py

@@ -260,7 +260,7 @@ class FreeZinbielAlgebra(CombinatorialFreeModule):
         if self._n is not None:
             self._assign_names(names)
 
-    def _repr_term(self, t):
+    def _repr_term(self, t) -> str:
         """
         Return a string representation of the basis element indexed by ``t``.
 
@@ -272,7 +272,7 @@ class FreeZinbielAlgebra(CombinatorialFreeModule):
         """
         return "{!s}[{!s}]".format(self._print_options['prefix'], repr(t)[6:])
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -672,7 +672,8 @@ class ZinbielFunctor(ConstructionFunctor):
         Functor.__init__(self, Rings(), Magmas())
         self.vars = variables
         self._side = side
-        self._finite_vars = bool(isinstance(variables, (list, tuple)) or variables in Sets().Finite())
+        self._finite_vars = (isinstance(variables, (list, tuple))
+                             or variables in Sets().Finite())
 
     def _apply_functor(self, R):
         """

sage/algebras/hall_algebra.py

@@ -256,7 +256,7 @@ class HallAlgebra(CombinatorialFreeModule):
         M.register_as_coercion()
         (~M).register_as_coercion()
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -624,7 +624,7 @@ class HallAlgebraMonomials(CombinatorialFreeModule):
         H = HallAlgebra(self.base_ring(), self._q)
         return reduce(lambda cur,r: cur * H.monomial(Partition([1]*r)), a, H.one())
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 

sage/algebras/hecke_algebras/ariki_koike_algebra.py

@@ -349,7 +349,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
         T.module_morphism(LT._from_T_basis, codomain=LT).register_as_coercion()
         LT.module_morphism(T._from_LT_basis, codomain=T).register_as_coercion()
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 
@@ -365,7 +365,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
         return "Ariki-Koike algebra of rank {} and order {} with q={} and u={} over {}".format(
             self._r, self._n, self._q, self._u, self.base_ring())
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.
 
@@ -469,7 +469,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
             """
             return [Realizations(self.base()), self.base()._category]
 
-        def _repr_(self):
+        def _repr_(self) -> str:
             r"""
             Return the representation of ``self``.
 
@@ -488,7 +488,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
             cases, these are just default implementations that will get
             specialized in a basis.
             """
-            def _repr_(self):
+            def _repr_(self) -> str:
                 r"""
                 Text representation of this basis of Iwahori-Hecke algebra.
 
@@ -633,7 +633,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
             _Basis.__init__(self, algebra, prefix='LT')
             self._assign_names(self.algebra_generators().keys())
 
-        def _repr_term(self, m):
+        def _repr_term(self, m) -> str:
             r"""
             Return a string representation of the basis element indexed by ``m``.
 
@@ -656,7 +656,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
                 return rhs
             return lhs + '*' + rhs
 
-        def _latex_term(self, m):
+        def _latex_term(self, m) -> str:
             r"""
             Return a latex representation for the basis element indexed by ``m``.
 
@@ -1231,7 +1231,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
             redword.extend(t[1].reduced_word())
             return redword
 
-        def _repr_term(self, t):
+        def _repr_term(self, t) -> str:
             r"""
             Return a string representation of the basis element indexed by ``m``.
 
@@ -1247,7 +1247,7 @@ class ArikiKoikeAlgebra(Parent, UniqueRepresentation):
             return (self._print_options['prefix']
                     + '[%s]' % ','.join('%d' % i for i in redword))
 
-        def _latex_term(self, t):
+        def _latex_term(self, t) -> str:
             r"""
             Return a latex representation for the basis element indexed by ``m``.
 

sage/algebras/hecke_algebras/ariki_koike_specht_modules.py

@@ -149,7 +149,7 @@ class SpechtModule(CombinatorialFreeModule):
         cat = Modules(R).FiniteDimensional().WithBasis()
         CombinatorialFreeModule.__init__(self, R, indices, category=cat, prefix='S')
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 
@@ -163,7 +163,7 @@ class SpechtModule(CombinatorialFreeModule):
         """
         return "Specht module of shape {} for {}".format(self._shape, self._AK)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return a latex representation of ``self``.