passagemath-groups 10.5.47__cp313-cp313-macosx_14_0_arm64.whl → 10.6.3__cp313-cp313-macosx_14_0_arm64.whl

{passagemath_groups-10.5.47.dist-info → passagemath_groups-10.6.3.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-groups
-Version: 10.5.47
+Version: 10.6.3
 Summary: passagemath: Groups and Invariant Theory
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -8,7 +8,7 @@ License-Expression: GPL-2.0-or-later
 Project-URL: release notes, https://github.com/passagemath/passagemath/releases
 Project-URL: repo (upstream), https://github.com/sagemath/sage
 Project-URL: repo, https://github.com/passagemath/passagemath
-Project-URL: documentation, https://doc.sagemath.org
+Project-URL: documentation, https://passagemath.org/docs/latest
 Project-URL: homepage (upstream), https://www.sagemath.org
 Project-URL: discourse, https://passagemath.discourse.group
 Project-URL: tracker (upstream), https://github.com/sagemath/sage/issues
@@ -17,20 +17,20 @@ Classifier: Development Status :: 6 - Mature
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
+Classifier: Operating System :: POSIX :: Linux
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-categories~=10.5.47.0
-Requires-Dist: passagemath-gap~=10.5.47.0
-Requires-Dist: passagemath-modules~=10.5.47.0
+Requires-Dist: passagemath-categories~=10.6.3.0
+Requires-Dist: passagemath-gap~=10.6.3.0
+Requires-Dist: passagemath-modules~=10.6.3.0
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: coxeter3
@@ -61,24 +61,25 @@ It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
 developed 2005-2025 under the motto “Creating a Viable Open Source
 Alternative to Magma, Maple, Mathematica, and MATLAB”.
 
-The passagemath fork was created in October 2024 with the following
-goals:
+The passagemath fork uses the motto "Creating a Free Passage Between the
+Scientific Python Ecosystem and Mathematical Software Communities."
+It was created in October 2024 with the following goals:
 
--  providing modularized installation with pip, thus completing a `major
-   project started in 2020 in the Sage
-   codebase <https://github.com/sagemath/sage/issues/29705>`__,
+-  providing modularized installation with pip,
 -  establishing first-class membership in the scientific Python
    ecosystem,
 -  giving `clear attribution of upstream
    projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
 -  providing independently usable Python interfaces to upstream
    libraries,
--  providing `platform portability and integration testing
+-  offering `platform portability and integration testing
    services <https://github.com/passagemath/passagemath/issues/704>`__
    to upstream projects,
 -  inviting collaborations with upstream projects,
 -  `building a professional, respectful, inclusive
    community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
+-  `empowering Sage users to participate in the scientific Python ecosystem
+   <https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
 -  developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
    serverless deployment with Javascript,
 -  developing a native Windows port.
@@ -86,24 +87,29 @@ goals:
 `Full documentation <https://doc.sagemath.org/html/en/index.html>`__ is
 available online.
 
-passagemath attempts to support all major Linux distributions and recent versions of
-macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
-virtualization.
+passagemath attempts to support and provides binary wheels suitable for
+all major Linux distributions and recent versions of macOS.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
-Python 3.13.x is also supported, but some third-party packages are still missing wheels,
-so compilation from source is triggered for those.
+For the Linux aarch64 (ARM) platform, some third-party packages are still missing
+wheels; see the `instructions for building them from source <https://github.com/passagemath/passagemath?tab=readme-ov-file#full-installation-of-passagemath-from-binary-wheels-on-pypi>`__.
+
+Binary wheels for native Windows (x86_64) are are available for a subset of
+the passagemath distributions. Use of the full functionality of passagemath
+on Windows currently requires the use of Windows Subsystem for Linux (WSL)
+or virtualization.
+
+The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
 
 
 About this pip-installable distribution package
 -----------------------------------------------
 
-This pip-installable package `passagemath-groups` a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", `passagemath-standard`) for computations with groups.
+This pip-installable package ``passagemath-groups`` a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", ``passagemath-standard``) for computations with groups.
 
 
 What is included
 ----------------
 
-* `Groups <https://doc.sagemath.org/html/en/reference/groups/index.html>`_
+* `Groups <https://passagemath.org/docs/latest/html/en/reference/groups/index.html>`_
 
 * see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-groups/MANIFEST.in

{passagemath_groups-10.5.47.dist-info → passagemath_groups-10.6.3.dist-info}/RECORD

@@ -1,25 +1,25 @@
-passagemath_groups-10.5.47.dist-info/RECORD,,
-passagemath_groups-10.5.47.dist-info/WHEEL,sha256=ZQJAUvKl3_G657Vy_VrVH7Krx2Keg1PVu64bdERsotU,136
-passagemath_groups-10.5.47.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
-passagemath_groups-10.5.47.dist-info/METADATA,sha256=z4RAaCT16Cgqw4PodjD2k1PlvyYD25pzRpSsG62z0jo,4884
+passagemath_groups-10.6.3.dist-info/RECORD,,
+passagemath_groups-10.6.3.dist-info/WHEEL,sha256=ZQJAUvKl3_G657Vy_VrVH7Krx2Keg1PVu64bdERsotU,136
+passagemath_groups-10.6.3.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
+passagemath_groups-10.6.3.dist-info/METADATA,sha256=RvTRT8natAcuhMW0id2BZTQtI9JqLl2VNc4WvviRIFQ,5382
 passagemath_groups.dylibs/libreadline.8.3.dylib,sha256=ufLMSAeOXYmbUdvwkvSj9DIEmVNQOMkXoWmYQgObGjc,316096
-passagemath_groups.dylibs/libgap.9.dylib,sha256=7ZyYtNTXRF_rr4nb3zKns2TS_jhwPYMp9pqYg8h-vfs,2475408
+passagemath_groups.dylibs/libgap.9.dylib,sha256=y9vvUuy8ly5WvQDhlQrDtAa5msLvCCL7ElAelonlgmk,2475408
 passagemath_groups.dylibs/libgmp.10.dylib,sha256=VOGM_HerjozBJCK3LuahuI9rYziM1R-CNDmv8CKisxw,464688
-sage/all__sagemath_groups.py,sha256=r79v2kKSV7vqPKchrDfS9MOANmHgfIB1uvFiby6HVPk,505
+sage/all__sagemath_groups.py,sha256=JOSY5oJmS67eaWpSs14SBcD7be6NMKH05esJQj8sNOI,525
 sage/groups/finitely_presented.py,sha256=hLccjNjrj880fFeiLu9W7Z7Xz1HewuyJTVKNWrUsVMI,70042
 sage/groups/fqf_orthogonal.py,sha256=8cx71JJorwsFoSPzVLBg1rI_dA9dfGeWDqA6GAuqRh8,20181
-sage/groups/free_group.py,sha256=Jp7zjjWcb4fwx5tXTW0km5C4MIA34IVptT4Q7Y153yM,29463
+sage/groups/free_group.py,sha256=iMxfq5y8gA91i7XdpCmlL2N-5s2h_oYYohITmhMpVXo,29468
 sage/groups/all__sagemath_groups.py,sha256=g4HxEDA-YDJcTYHqA5pGLBIy7gpzg-BEVb2Jn7mTJD8,1147
-sage/groups/artin.py,sha256=lnpgpA6m7fuAvlcIEjIRlr7IXCrKq9aKLTlkfrV3vlw,41036
+sage/groups/artin.py,sha256=Mm9gAYlUfq7kA8z44A2jTgdGaaDPM_TgGeXuj1nZf50,41096
 sage/groups/finitely_presented_named.py,sha256=dKB2M78fw5W7RTHCGy-VB_X9co9UbFcQQYSdBr945Rc,20597
 sage/groups/all.py,sha256=ia6P1nJW_QxBEPMNKdT6ZE8v7J0z8qlMbX2uD3lBJU8,229
 sage/groups/raag.py,sha256=WbkPRhwCopLc2PtJ_Zcy_QASzsHcsp84_fM1x_dUcWw,28842
 sage/groups/cubic_braid.py,sha256=LEStrE9YiJAb5acsybhoQhth5fh-wbtn7uLjYyLoO1o,86974
 sage/groups/group_semidirect_product.py,sha256=7XqgwRR8i-KAWQdRXE8uoNbYDG-mDTqFw2uyqhDGCwY,17910
 sage/groups/cactus_group.py,sha256=O0FTBvGw8y3nRSR1aGPn5FdEv3jILG7QK_g_lZYdLPc,32895
-sage/groups/braid.py,sha256=8QUyWn3-gJyl_68F0w1NAJADjJSCVFq9MniA7ssRDXA,139338
+sage/groups/braid.py,sha256=BGOPYX4UtA-s1TKDOGvGcB1dqBrwY85GZaLU-rOLzsA,139760
 sage/groups/finitely_presented_catalog.py,sha256=Ylc_cx0Sv6eKH9J-n4xotqWK0Hc4pNrwZ3iRPe-gh1s,1251
-sage/groups/group_exp.py,sha256=QYVMwfLD1WYTOBjLp0wvKvElyGStDlSagpToYX-Ot4s,11157
+sage/groups/group_exp.py,sha256=KjhnaTnqnNKvBmYZJEbUge2-RydGSkued1JFXSLzeoo,11190
 sage/groups/kernel_subgroup.py,sha256=hZVsh5UYfq6MPxekXwlRuQyPuHq0Fk6SlNnN-5Yja6A,7706
 sage/groups/lie_gps/catalog.py,sha256=O5ub0bmV3z8tvJEFjxhgjIz4Zff8rJksOe5VQp0py0o,363
 sage/groups/lie_gps/all.py,sha256=-vXQHOTG46Zum7Q6k0kcJO43yJo09AIX-El8fzXA7eI,45
@@ -31,8 +31,8 @@ sage/groups/abelian_gps/all.py,sha256=yQQEiBWy_vtucLyFb_q1OIqgiC_DIE9KUzNWpdGTa4
 sage/groups/semimonomial_transformations/semimonomial_transformation.pyx,sha256=9j9eS_uZYdCUQrTJDs4VhpO_7SeSzXdnzh0cACFNtkk,11298
 sage/groups/semimonomial_transformations/all.py,sha256=-vXQHOTG46Zum7Q6k0kcJO43yJo09AIX-El8fzXA7eI,45
 sage/groups/semimonomial_transformations/semimonomial_transformation_group.py,sha256=QflEYRK_oDUf8axx4kwcUR4aMOQNmE_faY1lzOdrAvQ,18312
-sage/groups/semimonomial_transformations/semimonomial_transformation.cpython-313-darwin.so,sha256=0SquVQXHewpec6Q__ZspH4t19BbO4nrA-EyA4nusBak,152752
+sage/groups/semimonomial_transformations/semimonomial_transformation.cpython-313-darwin.so,sha256=koG0rEn2Punk8pMl5qTeMVxRG67mCUASkPihzcwnI4c,152736
 sage/groups/semimonomial_transformations/semimonomial_transformation.pxd,sha256=wivg7LyXn_ZMrADRUmabPEYNitTRZCvs2htLN3E0v9g,297
 sage/geometry/all__sagemath_groups.py,sha256=-vXQHOTG46Zum7Q6k0kcJO43yJo09AIX-El8fzXA7eI,45
-sage/geometry/palp_normal_form.pyx,sha256=dElNMIah-kQ7xxwSh4ZW5_Fgo9685Md79dGbqcs8seQ,17502
-sage/geometry/palp_normal_form.cpython-313-darwin.so,sha256=aRdSG3xZPS4nm7rrSfKRmhGgZ30yI_9D9xmsuOZyGOA,239616
+sage/geometry/palp_normal_form.pyx,sha256=HfDpZHxffoxG2pxTrXO0ucRlEDZcrtzHBoZ0CoHm5lI,17498
+sage/geometry/palp_normal_form.cpython-313-darwin.so,sha256=ZlbOliYVyR_3yGedn4ENOM81B4co3ntQR3KAwle5N9A,239536

sage/all__sagemath_groups.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-groups
+# delvewheel: patch
 r"""
 Top level of the distribution package sagemath-groups
 

sage/geometry/palp_normal_form.pyx

@@ -198,7 +198,7 @@ def _palp_PM_max(Matrix_integer_dense PM, check=False):
         else:
             S[i] = i + 1
 
-    cdef int l, np, cf, ccf, n_s_bar, d1, v0, vc, vj
+    cdef int l, cf, ccf, n_s_bar, d1, v0, vc, vj
     cdef list l_r
 
     # We determine the other rows of PM_max in turn by use of perms and

sage/groups/artin.py

@@ -171,7 +171,7 @@ class ArtinGroupElement(FinitelyPresentedGroupElement):
             W = self.parent().coxeter_group()
         s = W.simple_reflections()
         In = W.index_set()
-        return W.prod(s[In[abs(i)-1]] for i in self.Tietze())
+        return W.prod(s[In[abs(i) - 1]] for i in self.Tietze())
 
     def burau_matrix(self, var='t'):
         r"""
@@ -624,10 +624,10 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
             return super().__classcall__(cls, coxeter_data, names)
         if coxeter_data.coxeter_type().cartan_type().type() == 'A':
             from sage.groups.braid import BraidGroup
-            return BraidGroup(coxeter_data.rank()+1, names)
+            return BraidGroup(coxeter_data.rank() + 1, names)
         return FiniteTypeArtinGroup(coxeter_data, names)
 
-    def __init__(self, coxeter_matrix, names):
+    def __init__(self, coxeter_matrix, names) -> None:
         """
         Initialize ``self``.
 
@@ -646,7 +646,7 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
         I = coxeter_matrix.index_set()
         gens = free_group.gens()
         for ii, i in enumerate(I):
-            for jj, j in enumerate(I[ii + 1:], start=ii+1):
+            for jj, j in enumerate(I[ii + 1:], start=ii + 1):
                 m = coxeter_matrix[i, j]
                 if m == Infinity:  # no relation
                     continue
@@ -657,7 +657,7 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
                 rels.append(elt)
         FinitelyPresentedGroup.__init__(self, free_group, tuple(rels))
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of ``self``.
 
@@ -792,7 +792,7 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
         return self.element_class(self, x)
 
     @cached_method
-    def an_element(self):
+    def _an_element_(self):
         """
         Return an element of ``self``.
 
@@ -804,7 +804,7 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
         """
         return self.gen(0)
 
-    def some_elements(self):
+    def some_elements(self) -> list:
         """
         Return a list of some elements of ``self``.
 
@@ -972,7 +972,8 @@ class ArtinGroup(UniqueRepresentation, FinitelyPresentedGroup):
                 elif x == 1:
                     return 1 + q**2
                 else:
-                    return q * (E(2*x) + ~E(2*x))
+                    E2x = E(2 * x)
+                    return q * (E2x + ~E2x)
         elif isinstance(base_ring, sage.rings.abc.NumberField_quadratic):
             from sage.rings.universal_cyclotomic_field import UniversalCyclotomicField
             E = UniversalCyclotomicField().gen

sage/groups/braid.py

@@ -5,7 +5,8 @@ Braid groups
 Braid groups are implemented as a particular case of finitely presented groups,
 but with a lot of specific methods for braids.
 
-A braid group can be created by giving the number of strands, and the name of the generators::
+A braid group can be created by giving the number of strands, and the name
+of the generators::
 
     sage: BraidGroup(3)
     Braid group on 3 strands
@@ -16,8 +17,8 @@ A braid group can be created by giving the number of strands, and the name of th
     sage: BraidGroup(3,'a,b').gens()
     (a, b)
 
-The elements can be created by operating with the generators, or by passing a list
-with the indices of the letters to the group::
+The elements can be created by operating with the generators, or by passing
+a list with the indices of the letters to the group::
 
     sage: B.<s0,s1,s2> = BraidGroup(4)
     sage: s0*s1*s0
@@ -82,7 +83,8 @@ from sage.groups.finitely_presented import (
     GroupMorphismWithGensImages,
 )
 from sage.groups.free_group import FreeGroup, is_FreeGroup
-from sage.groups.perm_gps.permgroup_named import SymmetricGroup, SymmetricGroupElement
+from sage.groups.perm_gps.permgroup_named import (SymmetricGroup,
+                                                  SymmetricGroupElement)
 from sage.libs.gap.libgap import libgap
 from sage.matrix.constructor import identity_matrix, matrix
 from sage.misc.cachefunc import cached_method
@@ -97,10 +99,11 @@ from sage.structure.element import Expression
 from sage.structure.richcmp import rich_to_bool, richcmp
 
 lazy_import('sage.libs.braiding',
-            ['leftnormalform', 'rightnormalform', 'centralizer', 'supersummitset', 'greatestcommondivisor',
+            ['leftnormalform', 'rightnormalform', 'centralizer',
+             'supersummitset', 'greatestcommondivisor',
              'leastcommonmultiple', 'conjugatingbraid', 'ultrasummitset',
              'thurston_type', 'rigidity', 'sliding_circuits', 'send_to_sss',
-             'send_to_uss', 'send_to_sc', 'trajectory', 'cyclic_slidings' ],
+             'send_to_uss', 'send_to_sc', 'trajectory', 'cyclic_slidings'],
             feature=sage__libs__braiding())
 lazy_import('sage.knots.knot', 'Knot')
 
@@ -503,7 +506,8 @@ class Braid(FiniteTypeArtinGroupElement):
         """
         return self.coxeter_group_element(W)
 
-    def plot(self, color='rainbow', orientation='bottom-top', gap=0.05, aspect_ratio=1, axes=False, **kwds):
+    def plot(self, color='rainbow', orientation='bottom-top', gap=0.05,
+             aspect_ratio=1, axes=False, **kwds):
         """
         Plot the braid.
 
@@ -637,7 +641,7 @@ class Braid(FiniteTypeArtinGroupElement):
 
     def plot3d(self, color='rainbow'):
         """
-        Plots the braid in 3d.
+        Plot the braid in 3d.
 
         The following option is available:
 
@@ -835,6 +839,7 @@ class Braid(FiniteTypeArtinGroupElement):
         r"""
         Return the representation matrix of ``self`` according to the R-matrix
         representation being attached to the quantum superalgebra `\mathfrak{sl}_q(2|1)`.
+
         See [MW2012]_, section 3 and references given there.
 
         INPUT:
@@ -867,15 +872,16 @@ class Braid(FiniteTypeArtinGroupElement):
         M = rep[0][0].parent().one()
         for i in self.Tietze():
             if i > 0:
-                M = M*rep[i-1][0]
+                M = M * rep[i-1][0]
             if i < 0:
-                M = M*rep[-i-1][1]
+                M = M * rep[-i-1][1]
         return M
 
     @cached_method
     def links_gould_polynomial(self, varnames=None, use_symbolics=False):
         r"""
         Return the Links-Gould polynomial of the closure of ``self``.
+
         See [MW2012]_, section 3 and references given there.
 
         INPUT:
@@ -913,12 +919,13 @@ class Braid(FiniteTypeArtinGroupElement):
         mu = rep[ln - 1]  # quantum trace factor
         M = mu * self.links_gould_matrix(symbolics=use_symbolics)
         d1, d2 = M.dimensions()
-        e = d1//4
+        e = d1 // 4
         B = M.base_ring()
         R = LaurentPolynomialRing(ZZ, varnames)
 
         # partial quantum trace according to I. Marin section 2.5
-        part_trace = matrix(B, 4, 4, lambda i, j: sum(M[e * i + k, e * j + k] for k in range(e)))
+        part_trace = matrix(B, 4, 4, lambda i, j: sum(M[e * i + k, e * j + k]
+                                                      for k in range(e)))
         ptemp = part_trace[0, 0]  # part_trace == psymb*M.parent().one()
         if use_symbolics:
             v1, v2 = R.variable_names()
@@ -929,13 +936,13 @@ class Braid(FiniteTypeArtinGroupElement):
         else:
             ltemp = ptemp.lift().constant_coefficient()
             # Since the result of the calculation is known to be a Laurent polynomial
-            # in t0 and t1 all exponents of ltemp must be divisable by 2
+            # in t0 and t1 all exponents of ltemp must be divisible by 2
             L = ltemp.parent()
             lred = L({(k[0]/2, k[1]/2): v for k, v in ltemp.monomial_coefficients().items()})
             t0, t1 = R.gens()
             return lred(t0, t1)
 
-    def tropical_coordinates(self):
+    def tropical_coordinates(self) -> list:
         r"""
         Return the tropical coordinates of ``self`` in the braid group `B_n`.
 
@@ -979,7 +986,7 @@ class Braid(FiniteTypeArtinGroupElement):
 
         from sage.rings.semirings.tropical_semiring import TropicalSemiring
         T = TropicalSemiring(ZZ)
-        return [T(_) for _ in coord]
+        return [T(c) for c in coord]
 
     def markov_trace(self, variab=None, normalized=True):
         r"""
@@ -1649,7 +1656,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return tuple([B(b) for b in rnf[:-1]] + [B.delta()**rnf[-1][0]])
 
-    def centralizer(self):
+    def centralizer(self) -> list:
         """
         Return a list of generators of the centralizer of the braid.
 
@@ -1665,7 +1672,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return [B._element_from_libbraiding(b) for b in c]
 
-    def super_summit_set(self):
+    def super_summit_set(self) -> list:
         """
         Return a list with the super summit set of the braid.
 
@@ -1787,10 +1794,9 @@ class Braid(FiniteTypeArtinGroupElement):
         cb = conjugatingbraid(self, other)
         if not cb:
             return None
-        else:
-            B = self.parent()
-            cb[0][0] %= 2
-            return B._element_from_libbraiding(cb)
+        B = self.parent()
+        cb[0][0] %= 2
+        return B._element_from_libbraiding(cb)
 
     def is_conjugated(self, other) -> bool:
         """
@@ -1909,7 +1915,7 @@ class Braid(FiniteTypeArtinGroupElement):
         n2 = len(b2.Tietze())
         return b2 if n2 <= n0 else b0
 
-    def ultra_summit_set(self):
+    def ultra_summit_set(self) -> list:
         """
         Return a list with the orbits of the ultra summit set of ``self``.
 
@@ -1939,7 +1945,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return [[B._element_from_libbraiding(i) for i in s] for s in uss]
 
-    def thurston_type(self):
+    def thurston_type(self) -> str:
         """
         Return the thurston_type of ``self``.
 
@@ -2029,7 +2035,7 @@ class Braid(FiniteTypeArtinGroupElement):
         """
         return Integer(rigidity(self))
 
-    def sliding_circuits(self):
+    def sliding_circuits(self) -> list:
         """
         Return the sliding circuits of the braid.
 
@@ -2332,7 +2338,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return tuple([B._element_from_libbraiding(b) for b in to_uss])
 
-    def sliding_circuits_element(self):
+    def sliding_circuits_element(self) -> tuple:
         r"""
         Return an element of the braid's sliding circuits, and the conjugating
         braid.
@@ -2348,7 +2354,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return tuple([B._element_from_libbraiding(b) for b in to_sc])
 
-    def trajectory(self):
+    def trajectory(self) -> list:
         r"""
         Return the braid's trajectory.
 
@@ -2366,7 +2372,7 @@ class Braid(FiniteTypeArtinGroupElement):
         B = self.parent()
         return [B._element_from_libbraiding(b) for b in traj]
 
-    def cyclic_slidings(self):
+    def cyclic_slidings(self) -> list:
         r"""
         Return the braid's cyclic slidings.
 
@@ -2551,6 +2557,7 @@ class RightQuantumWord:
         def tuple_to_word(q_tuple):
             return M.prod(self._gens[i]**exp
                           for i, exp in enumerate(q_tuple))
+
         ret = {tuple_to_word(q_tuple): q_factor
                for q_tuple, q_factor in self.tuples.items() if q_factor}
         return self._algebra._from_dict(ret, remove_zeros=False)
@@ -2614,7 +2621,7 @@ class RightQuantumWord:
         return sum(q_factor * eps_monom(q_tuple)
                    for q_tuple, q_factor in self.tuples.items())
 
-    def __repr__(self):
+    def __repr__(self) -> str:
         r"""
         String representation of ``self``.
 
@@ -2644,14 +2651,14 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         sage: B1
         Braid group on 5 strands
         sage: B2 = BraidGroup(3)
-        sage: B1==B2
+        sage: B1 == B2
         False
         sage: B2 is BraidGroup(3)
         True
     """
     Element = Braid
 
-    def __init__(self, names):
+    def __init__(self, names) -> None:
         """
         Python constructor.
 
@@ -2726,7 +2733,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         # For caching hermitian form of unitary Burau representation
         self._hermitian_form = None
 
-    def __reduce__(self):
+    def __reduce__(self) -> tuple:
         """
         TESTS::
 
@@ -2739,7 +2746,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         """
         return (BraidGroup_class, (self.variable_names(), ))
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation.
 
@@ -2816,7 +2823,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
                 x = self._standard_lift_Tietze(x)
         return self.element_class(self, x)
 
-    def an_element(self):
+    def _an_element_(self):
         """
         Return an element of the braid group.
 
@@ -2830,7 +2837,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         """
         return self.gen(0)
 
-    def some_elements(self):
+    def some_elements(self) -> list:
         """
         Return a list of some elements of the braid group.
 
@@ -2847,7 +2854,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         elements_list.append(elements_list[-1]**self.strands())
         return elements_list
 
-    def _standard_lift_Tietze(self, p):
+    def _standard_lift_Tietze(self, p) -> tuple:
         """
         Helper for :meth:`_standard_lift_Tietze`.
 
@@ -2875,8 +2882,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
             (1, 2, 3, 4, 1, 2)
         """
         G = SymmetricGroup(self.strands())
-        pl = G(p)
-        return tuple(pl.reduced_word())
+        return tuple(G(p).reduced_word())
 
     @cached_method
     def _links_gould_representation(self, symbolics=False):
@@ -2922,8 +2928,9 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         else:
             from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
             LR = LaurentPolynomialRing(ZZ, 's0r, s1r')
+            s0r, s1r = LR.gens()
             PR = PolynomialRing(LR, 'Yr')
-            s0r, s1r, Yr = PR.gens_dict_recursive().values()
+            Yr = PR.gen()
             pqr = Yr**2 + (s0r**2 - 1) * (s1r**2 - 1)
             BR = PR.quotient_ring(pqr)
             s0 = BR(s0r)
@@ -3488,9 +3495,10 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         r"""
         Return the mirror involution of ``self``.
 
-        This automorphism maps a braid to another one by replacing each generator
-        in its word by the inverse. In general this is different from the inverse
-        of the braid since the order of the generators in the word is not reversed.
+        This automorphism maps a braid to another one by replacing
+        each generator in its word by the inverse. In general this is
+        different from the inverse of the braid since the order of the
+        generators in the word is not reversed.
 
         EXAMPLES::
 
@@ -3554,7 +3562,7 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         h2 = G.hom(codomain=self, im_gens=[self(a) for a in L2], check=False)
         return (G, h1, h2)
 
-    def epimorphisms(self, H):
+    def epimorphisms(self, H) -> list:
         r"""
         Return the epimorphisms from ``self`` to ``H``, up to automorphism of `H` passing
         through the :meth:`two generator presentation
@@ -3587,12 +3595,18 @@ class BraidGroup_class(FiniteTypeArtinGroup):
         Gg = libgap(G)
         Hg = libgap(H)
         gquotients = Gg.GQuotients(Hg)
-        hom1g = libgap.GroupHomomorphismByImagesNC(G0g, Gg, [libgap(hom1(u)) for u in self.gens()])
+        hom1g = libgap.GroupHomomorphismByImagesNC(G0g, Gg,
+                                                   [libgap(hom1(u))
+                                                    for u in self.gens()])
         g0quotients = [hom1g * h for h in gquotients]
         res = []
+
         # the following closure is needed to attach a specific value of quo to
         # each function in the different morphisms
-        fmap = lambda tup: (lambda a: H(prod(tup[abs(i)-1]**sign(i) for i in a.Tietze())))
+        def fmap(tup):
+            return (lambda a: H(prod(tup[abs(i) - 1]**sign(i)
+                                     for i in a.Tietze())))
+
         for quo in g0quotients:
             tup = tuple(H(quo.ImageElm(i.gap()).sage()) for i in self.gens())
             fhom = GroupMorphismWithGensImages(HomSpace, fmap(tup))
@@ -3720,7 +3734,8 @@ class MappingClassGroupAction(Action):
 
         sage: A = B.mapping_class_action(F)
         sage: A
-        Right action by Braid group on 4 strands on Free Group on generators {x0, x1, x2, x3}
+        Right action by Braid group on 4 strands on Free Group
+        on generators {x0, x1, x2, x3}
         sage: A(x0, s1)
         x0
         sage: A(x1, s1)
@@ -3728,14 +3743,15 @@ class MappingClassGroupAction(Action):
         sage: A(x1^-1, s1)
         x1*x2^-1*x1^-1
     """
-    def __init__(self, G, M):
+    def __init__(self, G, M) -> None:
         """
         TESTS::
 
             sage: B = BraidGroup(3)
             sage: G = FreeGroup('a, b, c')
             sage: B.mapping_class_action(G) # indirect doctest
-            Right action by Braid group on 3 strands on Free Group on generators {a, b, c}
+            Right action by Braid group on 3 strands on Free Group
+            on generators {a, b, c}
         """
         import operator
         Action.__init__(self, G, M, False, operator.mul)

sage/groups/free_group.py

@@ -458,8 +458,9 @@ class FreeGroupElement(ElementLibGAP):
                 R = ring
             symb = list(im_gens)
             symb += reversed([a**(-1) for a in im_gens])
-        i = gen.Tietze()[0]  # So ``gen`` is the `i`-th
-                             # generator of the free group.
+        i = gen.Tietze()[0]
+        # so gen is the i-th generator of the free group
+
         a = R.zero()
         coef = R.one()
         while l:
@@ -507,7 +508,7 @@ class FreeGroupElement(ElementLibGAP):
         for i in range(k):
             exponent = exponent_syllable(g, i+1).sage()
             generator = gen(generator_syllable(g, i+1).sage() - 1)
-            result.append( (generator, exponent) )
+            result.append((generator, exponent))
         return tuple(result)
 
     def __call__(self, *values):
@@ -937,6 +938,7 @@ class FreeGroup_class(CachedRepresentation, Group, ParentLibGAP):
             Finitely presented group < a, b, c, d | a*b*a^-1 >
         """
         from sage.groups.finitely_presented import FinitelyPresentedGroup
-        return FinitelyPresentedGroup(self, tuple(map(self, relations) ), **kwds)
+        return FinitelyPresentedGroup(self,
+                                      tuple(map(self, relations)), **kwds)
 
     __truediv__ = quotient

sage/groups/group_exp.py

@@ -6,15 +6,15 @@ AUTHORS:
 
 - Mark Shimozono (2013): initial version
 """
-#*****************************************************************************
+# ***************************************************************************
 #       Copyright (C) 2013 <mshimo at math.vt.edu>
 #
 # This program is free software: you can redistribute it and/or modify
 # 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.categories.commutative_additive_groups import CommutativeAdditiveGroups
 from sage.categories.functor import Functor
@@ -169,7 +169,10 @@ class GroupExp(Functor):
         """
         new_domain = self._apply_functor(f.domain())
         new_codomain = self._apply_functor(f.codomain())
-        new_f = lambda a: new_codomain(f(a.value))
+
+        def new_f(a):
+            return new_codomain(f(a.value))
+
         return SetMorphism(Hom(new_domain, new_codomain, Groups()), new_f)
 
 
@@ -255,7 +258,7 @@ class GroupExp_Class(UniqueRepresentation, Parent):
         sage: GroupExp()(QQ)
         Multiplicative form of Rational Field
     """
-    def __init__(self, G):
+    def __init__(self, G) -> None:
         r"""
 
         EXAMPLES::
@@ -268,7 +271,7 @@ class GroupExp_Class(UniqueRepresentation, Parent):
         self._G = G
         Parent.__init__(self, category=Groups())
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string describing the multiplicative form of a commutative additive group.
 
@@ -308,7 +311,7 @@ class GroupExp_Class(UniqueRepresentation, Parent):
         """
         return GroupExpElement(self, self._G.zero())
 
-    def an_element(self):
+    def _an_element_(self):
         r"""
         Return an element of the multiplicative group.