passagemath-categories 10.6.13__tar.gz → 10.6.14__tar.gz

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-categories
-Version: 10.6.13
+Version: 10.6.14
 Summary: passagemath: Sage categories and basic rings
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -29,7 +29,7 @@ Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-objects~=10.6.13.0
+Requires-Dist: passagemath-objects~=10.6.14.0
 Requires-Dist: memory_allocator
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"

passagemath_categories-10.6.14/VERSION.txt

@@ -0,0 +1 @@
+10.6.14

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/passagemath_categories.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-categories
-Version: 10.6.13
+Version: 10.6.14
 Summary: passagemath: Sage categories and basic rings
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -29,7 +29,7 @@ Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-objects~=10.6.13.0
+Requires-Dist: passagemath-objects~=10.6.14.0
 Requires-Dist: memory_allocator
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/passagemath_categories.egg-info/requires.txt

@@ -1,4 +1,4 @@
-passagemath-objects~=10.6.13.0
+passagemath-objects~=10.6.14.0
 memory_allocator
 
 [test]

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/pyproject.toml

@@ -2,11 +2,11 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-conf ~= 10.6.13.0 ; sys_platform != "win32"',
-    'passagemath-setup ~= 10.6.13.0',
+    'passagemath-conf ~= 10.6.14.0 ; sys_platform != "win32"',
+    'passagemath-setup ~= 10.6.14.0',
     'jinja2',
-    'passagemath-environment ~= 10.6.13.0',
-    'passagemath-objects ~= 10.6.13.0',
+    'passagemath-environment ~= 10.6.14.0',
+    'passagemath-objects ~= 10.6.14.0',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'gmpy2 ~=2.1.b999',
     'memory_allocator',
@@ -19,7 +19,7 @@ build-backend = "setuptools.build_meta"
 name = "passagemath-categories"
 description = "passagemath: Sage categories and basic rings"
 dependencies = [
-    'passagemath-objects ~= 10.6.13.0',
+    'passagemath-objects ~= 10.6.14.0',
     'memory_allocator',
 ]
 dynamic = ["version"]

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/sage/categories/finite_dimensional_lie_algebras_with_basis.py

@@ -217,26 +217,28 @@ class FiniteDimensionalLieAlgebrasWithBasis(CategoryWithAxiom_over_base_ring):
 
             TESTS::
 
-                sage: L = lie_algebras.three_dimensional_by_rank(QQ, 3,                 # needs sage.groups sage.modules
+                sage: # needs sage.graphs sage.groups sage.modules
+                sage: L = lie_algebras.three_dimensional_by_rank(QQ, 3,
                 ....:                                            names=['E','F','H'])
-                sage: PBW = L.pbw_basis()                                               # needs sage.groups sage.modules
-                sage: PBW._basis_key('E') < PBW._basis_key('H')                         # needs sage.groups sage.modules
+                sage: PBW = L.pbw_basis()
+                sage: PBW._basis_key('E') < PBW._basis_key('H')
                 True
 
             ::
 
-                sage: L = lie_algebras.sl(QQ, 2)                                        # needs sage.groups sage.modules
+                sage: # needs sage.graphs sage.groups sage.modules
+                sage: L = lie_algebras.sl(QQ, 2)
                 sage: def neg_key(x):
                 ....:     return -L.basis().keys().index(x)
-                sage: PBW = L.pbw_basis(basis_key=neg_key)                              # needs sage.groups sage.modules
-                sage: prod(PBW.gens())  # indirect doctest                              # needs sage.groups sage.modules
+                sage: PBW = L.pbw_basis(basis_key=neg_key)
+                sage: prod(PBW.gens())  # indirect doctest
                 PBW[-alpha[1]]*PBW[alphacheck[1]]*PBW[alpha[1]]
                  - 4*PBW[-alpha[1]]*PBW[alpha[1]] + PBW[alphacheck[1]]^2
                  - 2*PBW[alphacheck[1]]
 
             Check that :issue:`23266` is fixed::
 
-                sage: # needs sage.groups sage.modules
+                sage: # needs sage.graphs sage.groups sage.modules
                 sage: sl2 = lie_algebras.sl(QQ, 2, 'matrix')
                 sage: sl2.indices()
                 {'e1', 'f1', 'h1'}

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/sage/categories/groups.py

@@ -308,7 +308,7 @@ class Groups(CategoryWithAxiom):
             of the elements themselves.  ::
 
                 sage: C = CyclicPermutationGroup(11)                                    # needs sage.groups
-                sage: C.cayley_table(names='digits')                                    # needs sage.groups
+                sage: C.cayley_table(names='digits')                                    # needs sage.groups sage.modules
                  *  00 01 02 03 04 05 06 07 08 09 10
                   +---------------------------------
                 00| 00 01 02 03 04 05 06 07 08 09 10
@@ -327,7 +327,7 @@ class Groups(CategoryWithAxiom):
 
                 sage: G = QuaternionGroup()                                             # needs sage.groups
                 sage: names = ['1', 'I', '-1', '-I', 'J', '-K', '-J', 'K']
-                sage: G.cayley_table(names=names)                                       # needs sage.groups
+                sage: G.cayley_table(names=names)                                       # needs sage.groups sage.modules
                  *   1  I -1 -I  J -K -J  K
                   +------------------------
                  1|  1  I -1 -I  J -K -J  K
@@ -341,8 +341,8 @@ class Groups(CategoryWithAxiom):
 
             ::
 
-                sage: A = AbelianGroup([2, 2])                                          # needs sage.groups
-                sage: A.cayley_table(names='elements')                                  # needs sage.groups
+                sage: A = AbelianGroup([2, 2])                                          # needs sage.groups sage.modules
+                sage: A.cayley_table(names='elements')                                  # needs sage.groups sage.modules
                     *      1    f1    f0 f0*f1
                      +------------------------
                     1|     1    f1    f0 f0*f1
@@ -354,7 +354,7 @@ class Groups(CategoryWithAxiom):
             routine behaves similarly, but changes an existing table "in-place."
             ::
 
-                sage: # needs sage.groups
+                sage: # needs sage.groups sage.modules
                 sage: G = AlternatingGroup(3)
                 sage: T = G.cayley_table()
                 sage: T.change_names('digits')

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/sage/rings/finite_rings/integer_mod.pyx

@@ -562,9 +562,9 @@ cdef class IntegerMod_abstract(FiniteRingElement):
             sage: a = Mod(2,19)
             sage: gap(a)
             Z(19)
-            sage: gap(Mod(3, next_prime(10000)))
+            sage: gap(Mod(3, next_prime(10000)))                                        # needs sage.libs.pari
             Z(10007)^6190
-            sage: gap(Mod(3, next_prime(100000)))
+            sage: gap(Mod(3, next_prime(100000)))                                       # needs sage.libs.pari
             ZmodpZObj( 3, 100003 )
             sage: gap(Mod(4, 48))
             ZmodnZObj( 4, 48 )

{passagemath_categories-10.6.13 → passagemath_categories-10.6.14}/sage/rings/finite_rings/integer_mod_ring.py

@@ -319,7 +319,7 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         sage: FF.order()
         29
 
-        sage: # needs sage.groups
+        sage: # needs sage.groups sage.libs.pari sage.modules
         sage: gens = FF.unit_gens()
         sage: a = gens[0]
         sage: a
@@ -381,7 +381,7 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         sage: Z16.characteristic()
         16
 
-        sage: # needs sage.groups
+        sage: # needs sage.groups sage.modules
         sage: gens = Z16.unit_gens()
         sage: gens
         (15, 5)
@@ -610,7 +610,7 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
 
         EXAMPLES::
 
-            sage: # optional - gap_package_polycyclic, needs sage.groups
+            sage: # optional - gap_package_polycyclic, needs sage.groups sage.libs.pari sage.modules
             sage: Integers(5).multiplicative_subgroups()
             ((2,), (4,), ())
             sage: Integers(15).multiplicative_subgroups()
@@ -622,11 +622,12 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
 
         TESTS::
 
-            sage: IntegerModRing(1).multiplicative_subgroups()                          # needs sage.groups
+            sage: # needs sage.groups sage.modules
+            sage: IntegerModRing(1).multiplicative_subgroups()
             ((),)
-            sage: IntegerModRing(2).multiplicative_subgroups()                          # needs sage.groups
+            sage: IntegerModRing(2).multiplicative_subgroups()
             ((),)
-            sage: IntegerModRing(3).multiplicative_subgroups()  # optional - gap_package_polycyclic, needs sage.groups
+            sage: IntegerModRing(3).multiplicative_subgroups()  # optional - gap_package_polycyclic
             ((2,), ())
         """
         return tuple(tuple(g.value() for g in H.gens())
@@ -1334,32 +1335,35 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
 
         EXAMPLES::
 
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: R = IntegerModRing(18)
-            sage: R.unit_gens()                                                         # needs sage.groups
+            sage: R.unit_gens()
             (11,)
             sage: R = IntegerModRing(17)
-            sage: R.unit_gens()                                                         # needs sage.groups
+            sage: R.unit_gens()
             (3,)
-            sage: IntegerModRing(next_prime(10^30)).unit_gens()                         # needs sage.groups
+            sage: IntegerModRing(next_prime(10^30)).unit_gens()
             (5,)
 
         The choice of generators is affected by the optional keyword
         ``algorithm``; this can be ``'sage'`` (default) or ``'pari'``.
         See :meth:`unit_group` for details. ::
 
+            sage: # needs sage.groups sage.modules
             sage: A = Zmod(55)
-            sage: A.unit_gens(algorithm='sage')                                         # needs sage.groups
+            sage: A.unit_gens(algorithm='sage')
             (12, 46)
-            sage: A.unit_gens(algorithm='pari')                                         # needs sage.groups sage.libs.pari
+            sage: A.unit_gens(algorithm='pari')                                         # needs sage.libs.pari
             (2, 21)
 
         TESTS::
 
-            sage: IntegerModRing(2).unit_gens()                                         # needs sage.groups
+            sage: # needs sage.groups sage.modules
+            sage: IntegerModRing(2).unit_gens()
             ()
-            sage: IntegerModRing(4).unit_gens()                                         # needs sage.groups
+            sage: IntegerModRing(4).unit_gens()
             (3,)
-            sage: IntegerModRing(8).unit_gens()                                         # needs sage.groups
+            sage: IntegerModRing(8).unit_gens()
             (7, 5)
         """
         return self.unit_group(**kwds).gens_values()
@@ -1368,11 +1372,12 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         """
         EXAMPLES::
 
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: R = IntegerModRing(17)
-            sage: R.unit_group_exponent()                                               # needs sage.groups
+            sage: R.unit_group_exponent()
             16
             sage: R = IntegerModRing(18)
-            sage: R.unit_group_exponent()                                               # needs sage.groups
+            sage: R.unit_group_exponent()
             6
         """
         return self.unit_group().exponent()
@@ -1384,7 +1389,7 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         EXAMPLES::
 
             sage: R = Integers(500)
-            sage: R.unit_group_order()                                                  # needs sage.groups
+            sage: R.unit_group_order()                                                  # needs sage.groups sage.libs.pari sage.modules
             200
         """
         return self.unit_group().order()
@@ -1422,7 +1427,7 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         differ in various ways.  In the following example, the same
         cyclic factors are computed, but in a different order::
 
-            sage: # needs sage.groups
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: A = Zmod(15)
             sage: G = A.unit_group(); G
             Multiplicative Abelian group isomorphic to C2 x C4
@@ -1436,42 +1441,42 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
         Here are two examples where the cyclic factors are isomorphic,
         but are ordered differently and have different generators::
 
-            sage: # needs sage.groups
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: A = Zmod(40)
             sage: G = A.unit_group(); G
             Multiplicative Abelian group isomorphic to C2 x C2 x C4
             sage: G.gens_values()
             (31, 21, 17)
-            sage: H = A.unit_group(algorithm='pari'); H                                 # needs sage.libs.pari
+            sage: H = A.unit_group(algorithm='pari'); H
             Multiplicative Abelian group isomorphic to C4 x C2 x C2
-            sage: H.gens_values()                                                       # needs sage.libs.pari
+            sage: H.gens_values()
             (17, 31, 21)
 
-            sage: # needs sage.groups
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: A = Zmod(192)
             sage: G = A.unit_group(); G
             Multiplicative Abelian group isomorphic to C2 x C16 x C2
             sage: G.gens_values()
             (127, 133, 65)
-            sage: H = A.unit_group(algorithm='pari'); H                                 # needs sage.libs.pari
+            sage: H = A.unit_group(algorithm='pari'); H
             Multiplicative Abelian group isomorphic to C16 x C2 x C2
-            sage: H.gens_values()                                                       # needs sage.libs.pari
+            sage: H.gens_values()
             (133, 127, 65)
 
         In the following examples, the cyclic factors are not even
         isomorphic::
 
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: A = Zmod(319)
-            sage: A.unit_group()                                                        # needs sage.groups
+            sage: A.unit_group()
             Multiplicative Abelian group isomorphic to C10 x C28
-            sage: A.unit_group(algorithm='pari')                                        # needs sage.groups sage.libs.pari
+            sage: A.unit_group(algorithm='pari')
             Multiplicative Abelian group isomorphic to C140 x C2
-
             sage: A = Zmod(30.factorial())
-            sage: A.unit_group()                                                        # needs sage.groups
+            sage: A.unit_group()
             Multiplicative Abelian group isomorphic to
              C2 x C16777216 x C3188646 x C62500 x C2058 x C110 x C156 x C16 x C18 x C22 x C28
-            sage: A.unit_group(algorithm='pari')                                        # needs sage.groups sage.libs.pari
+            sage: A.unit_group(algorithm='pari')
             Multiplicative Abelian group isomorphic to
              C20499647385305088000000 x C55440 x C12 x C12 x C4 x C2 x C2 x C2 x C2 x C2 x C2
 
@@ -1479,19 +1484,18 @@ class IntegerModRing_generic(quotient_ring.QuotientRing_generic, sage.rings.abc.
 
         We test the cases where the unit group is trivial::
 
-            sage: # needs sage.groups
+            sage: # needs sage.groups sage.libs.pari sage.modules
             sage: A = Zmod(1)
             sage: A.unit_group()
             Trivial Abelian group
-            sage: A.unit_group(algorithm='pari')                                        # needs sage.libs.pari
+            sage: A.unit_group(algorithm='pari')
             Trivial Abelian group
             sage: A = Zmod(2)
             sage: A.unit_group()
             Trivial Abelian group
-            sage: A.unit_group(algorithm='pari')                                        # needs sage.libs.pari
+            sage: A.unit_group(algorithm='pari')
             Trivial Abelian group
-
-            sage: Zmod(3).unit_group(algorithm='bogus')                                 # needs sage.groups
+            sage: Zmod(3).unit_group(algorithm='bogus')
             Traceback (most recent call last):
             ...
             ValueError: unknown algorithm 'bogus' for computing the unit group

passagemath_categories-10.6.13/VERSION.txt

@@ -1 +0,0 @@
-10.6.13