passagemath-schemes 10.5.48__cp312-cp312-musllinux_1_2_aarch64.whl → 10.6.47__cp312-cp312-musllinux_1_2_aarch64.whl

sage/modular/quasimodform/ring.py

@@ -7,7 +7,7 @@ Let `E_2` be the weight 2 Eisenstein series defined by
 
 .. MATH::
 
-    E_2(z) = 1 - \frac{2k}{B_k} \sum_{n=1}^{\infty} \sigma(n) q^n
+    E_2(z) = 1 - 24 \sum_{n=1}^{\infty} \sigma(n) q^n
 
 where `\sigma` is the sum of divisors function and `q = \mathrm{exp}(2\pi i z)`
 is the classical parameter at infinity, with `\mathrm{im}(z)>0`. This weight 2
@@ -16,7 +16,7 @@ modularity condition:
 
 .. MATH::
 
-    z^2 E_2(-1/z) = E_2(z) + \frac{2k}{4\pi i B_k z}.
+    z^2 E_2(-1/z) = E_2(z) + \frac{6}{\pi i z}.
 
 `E_2` is a quasimodular form of weight 2. General quasimodular forms of given
 weight can also be defined. We denote by `QM` the graded ring of quasimodular
@@ -47,9 +47,9 @@ EXAMPLES::
     sage: QM.category()
     Category of commutative graded algebras over Rational Field
     sage: QM.gens()
-    [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+    (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
      1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
-     1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
+     1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6))
     sage: E2 = QM.0; E4 = QM.1; E6 = QM.2
     sage: E2 * E4 + E6
     2 - 288*q - 20304*q^2 - 185472*q^3 - 855216*q^4 - 2697408*q^5 + O(q^6)
@@ -94,10 +94,10 @@ The other generators correspond to the generators given by the method
 :meth:`sage.modular.modform.ring.ModularFormsRing.gens`::
 
     sage: QM.gens()
-    [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+    (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
      1 + 6*q + 18*q^2 + 24*q^3 + 42*q^4 + 6*q^5 + O(q^6),
      1 + 240*q^5 + O(q^6),
-     q + 10*q^3 + 28*q^4 + 35*q^5 + O(q^6)]
+     q + 10*q^3 + 28*q^4 + 35*q^5 + O(q^6))
     sage: QM.modular_forms_subring().gens()
     [1 + 6*q + 18*q^2 + 24*q^3 + 42*q^4 + 6*q^5 + O(q^6),
      1 + 240*q^5 + O(q^6),
@@ -202,9 +202,9 @@ class QuasiModularForms(Parent, UniqueRepresentation):
         sage: QM = QuasiModularForms(1); QM
         Ring of Quasimodular Forms for Modular Group SL(2,Z) over Rational Field
         sage: QM.gens()
-        [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+        (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
          1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
-         1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
+         1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6))
 
     It is possible to access the weight 2 Eisenstein series::
 
@@ -456,9 +456,9 @@ class QuasiModularForms(Parent, UniqueRepresentation):
         """
         return self(self.__polynomial_subring.gen())
 
-    def gens(self):
+    def gens(self) -> tuple:
         r"""
-        Return a list of generators of the quasimodular forms ring.
+        Return a tuple of generators of the quasimodular forms ring.
 
         Note that the generators of the modular forms subring are the one given
         by the method :meth:`sage.modular.modform.ring.ModularFormsRing.gen_forms`
@@ -467,30 +467,30 @@ class QuasiModularForms(Parent, UniqueRepresentation):
 
             sage: QM = QuasiModularForms(1)
             sage: QM.gens()
-            [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+            (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
             1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
-            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
+            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6))
             sage: QM.modular_forms_subring().gen_forms()
             [1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
             1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
             sage: QM = QuasiModularForms(5)
             sage: QM.gens()
-            [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+            (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
             1 + 6*q + 18*q^2 + 24*q^3 + 42*q^4 + 6*q^5 + O(q^6),
             1 + 240*q^5 + O(q^6),
-            q + 10*q^3 + 28*q^4 + 35*q^5 + O(q^6)]
+            q + 10*q^3 + 28*q^4 + 35*q^5 + O(q^6))
 
         An alias of this method is ``generators``::
 
             sage: QuasiModularForms(1).generators()
-            [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+            (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
             1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
-            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
+            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6))
         """
         gen_list = [self.weight_2_eisenstein_series()]
-        for f in self.__modular_forms_subring.gen_forms():
-            gen_list.append(self(f))
-        return gen_list
+        gen_list.extend(self(f)
+                        for f in self.__modular_forms_subring.gen_forms())
+        return tuple(gen_list)
 
     generators = gens  # alias
 
@@ -531,7 +531,7 @@ class QuasiModularForms(Parent, UniqueRepresentation):
             sage: QM.4
             Traceback (most recent call last):
             ...
-            IndexError: list index out of range
+            IndexError: tuple index out of range
         """
         return self.gens()[n]
 
@@ -570,9 +570,9 @@ class QuasiModularForms(Parent, UniqueRepresentation):
         EXAMPLES::
 
             sage: QuasiModularForms(1).some_elements()
-            [1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
+            (1 - 24*q - 72*q^2 - 96*q^3 - 168*q^4 - 144*q^5 + O(q^6),
             1 + 240*q + 2160*q^2 + 6720*q^3 + 17520*q^4 + 30240*q^5 + O(q^6),
-            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6)]
+            1 - 504*q - 16632*q^2 - 122976*q^3 - 532728*q^4 - 1575504*q^5 + O(q^6))
         """
         return self.gens()
 

sage/modular/ssmod/ssmod.py

@@ -72,6 +72,7 @@ AUTHORS:
 from sage.arith.misc import kronecker, next_prime
 from sage.categories.fields import Fields
 from sage.matrix.matrix_space import MatrixSpace
+from sage.misc.cachefunc import cached_method
 from sage.misc.lazy_import import lazy_import
 from sage.modular.arithgroup.all import Gamma0
 from sage.modular.hecke.module import HeckeModule_free_module
@@ -489,6 +490,7 @@ class SupersingularModule(HeckeModule_free_module):
         """
         return ZZ**self.dimension()
 
+    @cached_method
     def dimension(self):
         r"""
         Return the dimension of the space of modular forms of weight 2
@@ -524,16 +526,10 @@ class SupersingularModule(HeckeModule_free_module):
 
         - Iftikhar Burhanuddin -- burhanud@usc.edu
         """
-        try:
-            return self.__dimension
-        except AttributeError:
-            pass
         if self.__level == 1:
             G = Gamma0(self.__prime)
-            self.__dimension = G.dimension_modular_forms(2)
-        else:
-            raise NotImplementedError
-        return self.__dimension
+            return G.dimension_modular_forms(2)
+        raise NotImplementedError
 
     rank = dimension
 
@@ -609,6 +605,7 @@ class SupersingularModule(HeckeModule_free_module):
         """
         return 2
 
+    @cached_method
     def supersingular_points(self):
         r"""
         Compute the supersingular j-invariants over the
@@ -649,10 +646,6 @@ class SupersingularModule(HeckeModule_free_module):
 
         - Iftikhar Burhanuddin -- burhanud@usc.edu
         """
-        try:
-            return (self._ss_points_dic, self._ss_points)
-        except AttributeError:
-            pass
         Fp2 = self.__finite_field
         level = self.__level
         prime = Fp2.characteristic()

sage/rings/polynomial/binary_form_reduce.py

@@ -193,7 +193,7 @@ def covariant_z0(F, z0_cov=False, prec=53, emb=None, error_limit=0.000001):
         FM = f  # for Julia's invariant
     else:
         # solve the minimization problem for 'true' covariant
-        CF = ComplexIntervalField(prec=prec)  # keeps trac of our precision error
+        CF = ComplexIntervalField(prec=prec)  # keeps track of our precision error
         z = CF(z)
         FM = F(list(mat * vector(R.gens()))).subs({R.gen(1): 1}).univariate_polynomial()
         from sage.rings.polynomial.complex_roots import complex_roots

sage/schemes/curves/affine_curve.py

@@ -1593,10 +1593,10 @@ class AffineCurve_field(AffineCurve, AlgebraicScheme_subscheme_affine_field):
         t = 0
         # loop through the patches and blow up each until no patch has singular points
         while not_resolved:
-            [BC, t_maps, pi, pts] = [res[t][0], res[t][1], res[t][2], res[t][3]]
+            BC, t_maps, pi, pts = res[t][0], res[t][1], res[t][2], res[t][3]
             # check if there are any singular points in this patch
             if not pts:
-                t = t + 1
+                t += 1
                 if t == len(res):
                     not_resolved = False
                 continue
@@ -1763,7 +1763,7 @@ class AffinePlaneCurve_field(AffinePlaneCurve, AffineCurve_field):
     """
     _point = AffinePlaneCurvePoint_field
 
-    def has_vertical_asymptote(self):
+    def has_vertical_asymptote(self) -> bool:
         """
         Check if the curve is not a line and has vertical asymptotes.
 
@@ -1783,7 +1783,7 @@ class AffinePlaneCurve_field(AffinePlaneCurve, AffineCurve_field):
         dxy = f.coefficient({y: dy}).degree()
         return dxy > 0 and f.degree() > 1
 
-    def is_vertical_line(self):
+    def is_vertical_line(self) -> bool:
         """
         Check if the curve is a vertical line.
 

sage/schemes/curves/plane_curve_arrangement.py

@@ -44,10 +44,11 @@ AUTHORS:
 # 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 itertools import combinations
+from typing import Any
+
 from sage.categories.sets_cat import Sets
 from sage.misc.abstract_method import abstract_method
 from sage.misc.cachefunc import cached_method
@@ -74,7 +75,7 @@ class PlaneCurveArrangementElement(Element):
     """
     An ordered plane curve arrangement.
     """
-    def __init__(self, parent, curves, check=True):
+    def __init__(self, parent, curves, check=True) -> None:
         """
         Construct a plane curve arrangement.
 
@@ -123,7 +124,7 @@ class PlaneCurveArrangementElement(Element):
         """
         return self._curves[i]
 
-    def __hash__(self):
+    def __hash__(self) -> int:
         r"""
         TESTS::
 
@@ -133,7 +134,7 @@ class PlaneCurveArrangementElement(Element):
         """
         return hash(self.curves())
 
-    def ncurves(self):
+    def ncurves(self) -> int:
         r"""
         Return the number of curves in the arrangement.
 
@@ -152,7 +153,7 @@ class PlaneCurveArrangementElement(Element):
 
     __len__ = ncurves
 
-    def curves(self):
+    def curves(self) -> tuple:
         r"""
         Return the curves in the arrangement as a tuple.
 
@@ -173,7 +174,7 @@ class PlaneCurveArrangementElement(Element):
         """
         return self._curves
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         String representation for a curve arrangement.
 
@@ -198,11 +199,11 @@ class PlaneCurveArrangementElement(Element):
             curves = ', '.join(h.defining_polynomial()._repr_()
                                for h in self._curves)
             return 'Arrangement ({}) in {}'.format(curves,
-                                                     self.parent().ambient_space())
+                                                   self.parent().ambient_space())
         return 'Arrangement of {} curves in {}'.format(len(self),
-                                                         self.parent().ambient_space())
+                                                       self.parent().ambient_space())
 
-    def _richcmp_(self, other, op):
+    def _richcmp_(self, other, op) -> bool:
         """
         Compare two curve arrangements.
 
@@ -340,7 +341,7 @@ class PlaneCurveArrangementElement(Element):
         """
         return self._curves[0].defining_polynomial().parent()
 
-    def defining_polynomials(self):
+    def defining_polynomials(self) -> tuple:
         r"""
         Return the defining polynomials of the elements of ``self``.
 
@@ -366,7 +367,7 @@ class PlaneCurveArrangementElement(Element):
         """
         return prod(self.defining_polynomials())
 
-    def have_common_factors(self):
+    def have_common_factors(self) -> bool:
         r"""
         Check if the curves have common factors.
 
@@ -392,7 +393,7 @@ class PlaneCurveArrangementElement(Element):
         - ``clean`` -- boolean (default: ``False``); if ``False``
           and there are common factors it returns ``None`` and
           a warning message. If ``True``, the common factors are kept
-          only in the first occurance.
+          only in the first occurrence.
 
         EXAMPLES::
 
@@ -431,7 +432,7 @@ class AffinePlaneCurveArrangementElement(PlaneCurveArrangementElement):
     """
     An ordered affine plane curve arrangement.
     """
-    def __init__(self, parent, curves, check=True):
+    def __init__(self, parent, curves, check=True) -> None:
         """
         Construct an ordered affine plane curve arrangement.
 
@@ -587,7 +588,7 @@ class AffinePlaneCurveArrangementElement(PlaneCurveArrangementElement):
             self._meridians_nonsimpl_nonvertical = dic
         return G
 
-    def meridians(self, simplified=True, vertical=True):
+    def meridians(self, simplified=True, vertical=True) -> dict:
         r"""
         Return the meridians of each irreducible component.
 
@@ -637,8 +638,9 @@ class AffinePlaneCurveArrangementElement(PlaneCurveArrangementElement):
     def braid_monodromy(self, vertical=True):
         r"""
         Return the braid monodromy of the complement of the union
-        of affine plane curves in `\CC^2`. If there are vertical
-        asymptotes a change of variable is done.
+        of affine plane curves in `\CC^2`.
+
+        If there are vertical asymptotes a change of variable is done.
 
         INPUT:
 
@@ -648,7 +650,7 @@ class AffinePlaneCurveArrangementElement(PlaneCurveArrangementElement):
 
         OUTPUT:
 
-        A braid monodromy with dictionnaries identifying strands with components
+        A braid monodromy with dictionaries identifying strands with components
         and braids with vertical lines.
 
         .. NOTE::
@@ -811,7 +813,7 @@ class ProjectivePlaneCurveArrangementElement(PlaneCurveArrangementElement):
     def fundamental_group(self, simplified=True):
         r"""
         Return the fundamental group of the complement of the union
-        of an arragnement of projective plane curves
+        of an arrangement of projective plane curves
         in the projective plane.
 
         INPUT:
@@ -924,7 +926,7 @@ class ProjectivePlaneCurveArrangementElement(PlaneCurveArrangementElement):
             self._meridians_nonsimpl = dic1
         return G
 
-    def meridians(self, simplified=True):
+    def meridians(self, simplified=True) -> dict:
         r"""
         Return the meridians of each irreducible component.
 
@@ -994,7 +996,7 @@ class PlaneCurveArrangements(UniqueRepresentation, Parent):
     Element = PlaneCurveArrangementElement
 
     @staticmethod
-    def __classcall__(cls, base, names=()):
+    def __classcall__(cls, base, names: tuple[str, ...] = ()):
         """
         Normalize the inputs to ensure a unique representation.
 
@@ -1008,7 +1010,7 @@ class PlaneCurveArrangements(UniqueRepresentation, Parent):
         names = normalize_names(len(names), names)
         return super().__classcall__(cls, base, names)
 
-    def __init__(self, base_ring, names=()):
+    def __init__(self, base_ring, names: tuple[str, ...] = ()):
         """
         Initialize ``self``.
 
@@ -1064,6 +1066,8 @@ class PlaneCurveArrangements(UniqueRepresentation, Parent):
             sage: L.change_ring(QQ) is L
             True
         """
+        # return self.__class__(base_ring, names=self.variable_names())
+        # line below is ugly but line above does not work
         return self.__reduce__()[1][0](base_ring, names=self.variable_names())
 
     @abstract_method
@@ -1127,7 +1131,7 @@ class PlaneCurveArrangements(UniqueRepresentation, Parent):
             arg = tuple(args)
         ambient_space = self.ambient_space()
         R = ambient_space.coordinate_ring()
-        curves = ()
+        curves: tuple[Any, ...] = ()
         for h in arg:
             try:
                 ambient = h.ambient_space()
@@ -1176,7 +1180,7 @@ class PlaneCurveArrangements(UniqueRepresentation, Parent):
         """
         return len(self.variable_names())
 
-    def gens(self):
+    def gens(self) -> tuple:
         """
         Return the coordinates.
 

sage/schemes/elliptic_curves/BSD.py

@@ -338,7 +338,7 @@ def prove_BSD(E, verbosity=0, two_desc='mwrank', proof=None, secs_hi=5,
     - [Kat2004]_
     - [Kol1991]_
     - [LW2015]_
-    - [LS]
+    - [LS]_
     - [Maz1978]_
     - [Rub1991]_
     - [SW2013]_

sage/schemes/elliptic_curves/addition_formulas_ring.py

@@ -1,4 +1,8 @@
 # sage_setup: distribution = sagemath-schemes
+r"""
+Addition formula for elliptic curves over rings
+"""
+
 
 def _add(E, P, Q):
     r"""

sage/schemes/elliptic_curves/cm.py

@@ -826,7 +826,7 @@ def discriminants_with_bounded_class_number(hmax, B=None, proof=None):
 
     # h_dict caches the class number h of all discriminants previously
     # encountered; we will use the function OrderClassNumber() to
-    # quicky compute the class number of non-fundamental discriminants
+    # quickly compute the class number of non-fundamental discriminants
     # from the fundamental ones. Note that in the initialisation, the
     # keys of h_dict include nonfundamental discriminants, but we only
     # update it with fundamental ones.

sage/schemes/elliptic_curves/constructor.py

@@ -1473,7 +1473,7 @@ def EllipticCurves_with_good_reduction_outside_S(S=[], proof=None, verbose=False
 
     EXAMPLES::
 
-        sage: # needs eclib
+        sage: # needs eclib sage.symbolic
         sage: EllipticCurves_with_good_reduction_outside_S([])
         []
         sage: elist = EllipticCurves_with_good_reduction_outside_S([2])
@@ -1489,14 +1489,14 @@ def EllipticCurves_with_good_reduction_outside_S(S=[], proof=None, verbose=False
 
     Without ``Proof=False``, this example gives two warnings::
 
-        sage: # needs eclib
+        sage: # needs eclib sage.symbolic
         sage: elist = EllipticCurves_with_good_reduction_outside_S([11], proof=False)   # long time (14s on sage.math, 2011)
         sage: len(elist)                                                                # long time
         12
         sage: ', '.join(e.label() for e in elist)                                       # long time
         '11a1, 11a2, 11a3, 121a1, 121a2, 121b1, 121b2, 121c1, 121c2, 121d1, 121d2, 121d3'
 
-        sage: # long time, needs eclib
+        sage: # long time, needs eclib sage.symbolic
         sage: elist = EllipticCurves_with_good_reduction_outside_S([2,3])               # long time (26s on sage.math, 2011)
         sage: len(elist)
         752

sage/schemes/elliptic_curves/ell_egros.py

@@ -320,7 +320,7 @@ def egros_from_jlist(jlist, S=[]):
 
     EXAMPLES::
 
-        sage: # needs eclib
+        sage: # needs eclib sage.symbolic
         sage: from sage.schemes.elliptic_curves.ell_egros import egros_get_j, egros_from_jlist
         sage: jlist = egros_get_j([3])
         sage: elist = egros_from_jlist(jlist,[3])