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

sage/combinat/tiling.py

@@ -313,36 +313,36 @@ def ncube_isometry_group(n, orientation_preserving=True):
     EXAMPLES::
 
         sage: from sage.combinat.tiling import ncube_isometry_group
-        sage: ncube_isometry_group(2)
+        sage: sorted(ncube_isometry_group(2))
         [
-        [1 0]  [ 0  1]  [-1  0]  [ 0 -1]
-        [0 1], [-1  0], [ 0 -1], [ 1  0]
+        [-1  0]  [ 0 -1]  [ 0  1]  [1 0]
+        [ 0 -1], [ 1  0], [-1  0], [0 1]
         ]
-        sage: ncube_isometry_group(2, orientation_preserving=False)
+        sage: sorted(ncube_isometry_group(2, orientation_preserving=False))
         [
-        [1 0]  [ 0 -1]  [ 1  0]  [ 0  1]  [0 1]  [-1  0]  [ 0 -1]  [-1  0]
-        [0 1], [-1  0], [ 0 -1], [-1  0], [1 0], [ 0 -1], [ 1  0], [ 0  1]
+        [-1  0]  [-1  0]  [ 0 -1]  [ 0 -1]  [ 0  1]  [0 1]  [ 1  0]  [1 0]
+        [ 0 -1], [ 0  1], [-1  0], [ 1  0], [-1  0], [1 0], [ 0 -1], [0 1]
         ]
 
     There are 24 orientation preserving isometries of the 3-cube::
 
-        sage: ncube_isometry_group(3)
+        sage: sorted(ncube_isometry_group(3))
         [
-        [1 0 0]  [ 1  0  0]  [ 1  0  0]  [ 0  1  0]  [0 1 0]  [ 0  0  1]
-        [0 1 0]  [ 0  0  1]  [ 0  0 -1]  [-1  0  0]  [0 0 1]  [ 0 -1  0]
-        [0 0 1], [ 0 -1  0], [ 0  1  0], [ 0  0  1], [1 0 0], [ 1  0  0],
+        [-1  0  0]  [-1  0  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0 -1  0]
+        [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [ 0  1  0]  [-1  0  0]  [ 0  0 -1]
+        [ 0  0  1], [ 0 -1  0], [ 0  1  0], [ 0  0 -1], [ 0  0 -1], [ 1  0  0],
         <BLANKLINE>
-        [-1  0  0]  [ 0 -1  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0  0 -1]
-        [ 0 -1  0]  [ 0  0 -1]  [ 0  0 -1]  [ 0  1  0]  [ 0  0  1]  [ 1  0  0]
-        [ 0  0  1], [ 1  0  0], [ 0 -1  0], [ 0  0 -1], [-1  0  0], [ 0 -1  0],
+        [ 0 -1  0]  [ 0 -1  0]  [ 0  0 -1]  [ 0  0 -1]  [ 0  0 -1]  [ 0  0 -1]
+        [ 0  0  1]  [ 1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0  1  0]  [ 1  0  0]
+        [-1  0  0], [ 0  0  1], [ 0  1  0], [-1  0  0], [ 1  0  0], [ 0 -1  0],
         <BLANKLINE>
-        [ 0  1  0]  [ 0  0  1]  [0 0 1]  [ 0 -1  0]  [ 0  0 -1]  [-1  0  0]
-        [ 1  0  0]  [ 0  1  0]  [1 0 0]  [ 1  0  0]  [ 0  1  0]  [ 0  0  1]
-        [ 0  0 -1], [-1  0  0], [0 1 0], [ 0  0  1], [ 1  0  0], [ 0  1  0],
+        [ 0  0  1]  [ 0  0  1]  [ 0  0  1]  [0 0 1]  [ 0  1  0]  [ 0  1  0]
+        [-1  0  0]  [ 0 -1  0]  [ 0  1  0]  [1 0 0]  [-1  0  0]  [ 0  0 -1]
+        [ 0 -1  0], [ 1  0  0], [-1  0  0], [0 1 0], [ 0  0  1], [-1  0  0],
         <BLANKLINE>
-        [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [ 1  0  0]  [ 0  0 -1]  [ 0  1  0]
-        [-1  0  0]  [-1  0  0]  [-1  0  0]  [ 0 -1  0]  [ 0 -1  0]  [ 0  0 -1]
-        [ 0  0 -1], [ 0  1  0], [ 0 -1  0], [ 0  0 -1], [-1  0  0], [-1  0  0]
+        [0 1 0]  [ 0  1  0]  [ 1  0  0]  [ 1  0  0]  [ 1  0  0]  [1 0 0]
+        [0 0 1]  [ 1  0  0]  [ 0 -1  0]  [ 0  0 -1]  [ 0  0  1]  [0 1 0]
+        [1 0 0], [ 0  0 -1], [ 0  0 -1], [ 0  1  0], [ 0 -1  0], [0 0 1]
         ]
 
     TESTS::
@@ -1067,9 +1067,8 @@ class Polyomino(SageObject):
         minxyz, maxxyz = vector(minxyz), vector(maxxyz)
         size = maxxyz - minxyz
         boxminxyz, boxmaxxyz = box.bounding_box()
-        ranges = [range(a, b-c+1) for (a,b,c) in zip(boxminxyz,
-                                                   boxmaxxyz,
-                                                   size)]
+        ranges = [range(a, b - c + 1)
+                  for a, b, c in zip(boxminxyz, boxmaxxyz, size)]
         cano = self.canonical()
         for v in itertools.product(*ranges):
             translated = cano + v
@@ -1121,9 +1120,8 @@ class Polyomino(SageObject):
         minxyz, maxxyz = vector(minxyz), vector(maxxyz)
         size = maxxyz - minxyz
         boxminxyz, boxmaxxyz = box.bounding_box()
-        ranges = [range(a-c, b+1) for (a,b,c) in zip(boxminxyz,
-                                                   boxmaxxyz,
-                                                   size)]
+        ranges = [range(a - c, b + 1)
+                  for a, b, c in zip(boxminxyz, boxmaxxyz, size)]
         S = set()
         cano = self.canonical()
         for v in itertools.product(*ranges):
@@ -1134,7 +1132,7 @@ class Polyomino(SageObject):
         return S
 
     def isometric_copies(self, box, orientation_preserving=True,
-            mod_box_isometries=False):
+                         mod_box_isometries=False):
         r"""
         Return the translated and isometric images of ``self`` that lies in the box.
 
@@ -1453,6 +1451,7 @@ class Polyomino(SageObject):
 
         ::
 
+            sage: # long time
             sage: solution = H.self_surrounding(8, remove_incomplete_copies=False)      # needs sage.plot
             sage: G = sum([p.show2d() for p in solution], Graphics())                   # needs sage.plot
         """
@@ -1605,7 +1604,7 @@ class TilingSolver(SageObject):
         self._reusable = reusable
         self._outside = outside
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         String representation.
 
@@ -1628,7 +1627,7 @@ class TilingSolver(SageObject):
         s += "Reusing pieces allowed: %s" % self._reusable
         return s
 
-    def is_suitable(self):
+    def is_suitable(self) -> bool:
         r"""
         Return whether the volume of the box is equal to sum of the volume
         of the polyominoes and the number of rows sent to the DLX solver is
@@ -2410,23 +2409,21 @@ class TilingSolver(SageObject):
             sage: a = T.animate('incremental', stop=13); a      # not tested            # needs sage.plot
             Animation with 13 frames
         """
+        from sage.plot.graphics import Graphics
+        from sage.plot.animate import Animation
         dimension = self._box._dimension
         if dimension == 2:
-            from sage.plot.graphics import Graphics
-            from sage.plot.animate import Animation
             it = self.solve(partial=partial)
             it = itertools.islice(it, stop)
-            L = [sum([piece.show2d(size)
-                      for piece in solution], Graphics()) for solution in it]
-            (xmin,ymin), (xmax,ymax) = self._box.bounding_box()
-            xmax = xmax+0.5
-            ymax = ymax+0.5
-            a = Animation(L, xmin=xmin-0.5, ymin=ymin-0.5,
-                          xmax=xmax, ymax=ymax, aspect_ratio=1, axes=axes)
-            return a
-        elif dimension == 3:
+            L = [sum([piece.show2d(size) for piece in solution], Graphics())
+                 for solution in it]
+            (xmin, ymin), (xmax, ymax) = self._box.bounding_box()
+            xmax = xmax + 0.5
+            ymax = ymax + 0.5
+            return Animation(L, xmin=xmin - 0.5, ymin=ymin - 0.5,
+                             xmax=xmax, ymax=ymax, aspect_ratio=1, axes=axes)
+        if dimension == 3:
             raise NotImplementedError("3d Animation must be implemented "
                                       "in Jmol first")
-        else:
-            raise NotImplementedError("Dimension must be 2 or 3 in order "
-                                      "to make an animation")
+        raise NotImplementedError("Dimension must be 2 or 3 in order "
+                                  "to make an animation")

sage/combinat/triangles_FHM.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-combinat
+# sage.doctest: known bug: windows (hangs)
 """
 Combinatorial triangles for posets and fans
 
@@ -47,6 +48,8 @@ The Gamma-triangles are related to the H-triangles by an
 analog of the relationship between gamma-vectors and h-vectors of flag
 simplicial complexes.
 """
+from __future__ import annotations
+
 from sage.misc.lazy_import import lazy_import
 from sage.rings.integer_ring import ZZ
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
@@ -133,7 +136,7 @@ class Triangle(SageObject):
         ⎝1 4⎠
     """
 
-    def __init__(self, poly, variables=None):
+    def __init__(self, poly, variables=None) -> None:
         """
         EXAMPLES::
 
@@ -195,7 +198,7 @@ class Triangle(SageObject):
         """
         return self._prefix + ": " + repr(self._poly)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return the LaTeX representation (as a matrix).
 
@@ -276,7 +279,7 @@ class Triangle(SageObject):
         """
         return self._poly.__getitem__(*args)
 
-    def __hash__(self):
+    def __hash__(self) -> int:
         """
         Return the hash value.
 
@@ -344,6 +347,26 @@ class Triangle(SageObject):
             p = p.truncate(v, d)
         return self.__class__(p, self._vars)
 
+    def factor(self) -> list:
+        """
+        Return the decomposition of ``self`` as a product.
+
+        This is defined by factoring the underlying polynomial.
+
+        EXAMPLES::
+
+            sage: from sage.combinat.triangles_FHM import M_triangle
+            sage: x, y = polygens(ZZ, 'x,y')
+            sage: p = 3*x^3*y^3 - 7*x^2*y^3 + 5*x^2*y^2
+            sage: p += 5*x*y^3 - 8*x*y^2 - y^3 + 3*x*y + 3*y^2 - 3*y + 1
+            sage: m = M_triangle(p)
+            sage: m.factor()
+            [M: x*y - y + 1, M: 3*x^2*y^2 - 4*x*y^2 + 2*x*y + y^2 - 2*y + 1]
+        """
+        p = self._poly
+        return [self.__class__(fac, self._vars)
+                for fac, exp in p.factor() for _ in range(exp)]
+
 
 class M_triangle(Triangle):
     """
@@ -360,7 +383,7 @@ class M_triangle(Triangle):
     """
     _prefix = 'M'
 
-    def dual(self):
+    def dual(self) -> M_triangle:
         """
         Return the dual M-triangle.
 
@@ -385,7 +408,7 @@ class M_triangle(Triangle):
                      for (dx, dy), coeff in self._poly.monomial_coefficients().items()}
         return M_triangle(A(dict_dual), variables=(x, y))
 
-    def transmute(self):
+    def transmute(self) -> M_triangle:
         """
         Return the image of ``self`` by an involution.
 
@@ -407,7 +430,7 @@ class M_triangle(Triangle):
         """
         return self.h().transpose().m()
 
-    def h(self):
+    def h(self) -> H_triangle:
         """
         Return the associated H-triangle.
 
@@ -434,7 +457,7 @@ class M_triangle(Triangle):
         polyh = step.numerator()
         return H_triangle(polyh, variables=(x, y))
 
-    def f(self):
+    def f(self) -> F_triangle:
         """
         Return the associated F-triangle.
 
@@ -462,7 +485,7 @@ class H_triangle(Triangle):
     """
     _prefix = 'H'
 
-    def transpose(self):
+    def transpose(self) -> H_triangle:
         """
         Return the transposed H-triangle.
 
@@ -489,7 +512,7 @@ class H_triangle(Triangle):
                      for (dx, dy), coeff in self._poly.monomial_coefficients().items()}
         return H_triangle(A(dict_dual), variables=(x, y))
 
-    def m(self):
+    def m(self) -> M_triangle:
         """
         Return the associated M-triangle.
 
@@ -510,7 +533,7 @@ class H_triangle(Triangle):
         polym = step.numerator()
         return M_triangle(polym, variables=(x, y))
 
-    def f(self):
+    def f(self) -> F_triangle:
         """
         Return the associated F-triangle.
 
@@ -544,7 +567,7 @@ class H_triangle(Triangle):
         polyf = step2.numerator()
         return F_triangle(polyf, variables=(x, y))
 
-    def gamma(self):
+    def gamma(self) -> Gamma_triangle:
         """
         Return the associated Gamma-triangle.
 
@@ -599,7 +622,7 @@ class F_triangle(Triangle):
     """
     _prefix = 'F'
 
-    def h(self):
+    def h(self) -> H_triangle:
         """
         Return the associated H-triangle.
 
@@ -626,7 +649,7 @@ class F_triangle(Triangle):
         polyh = step.numerator()
         return H_triangle(polyh, variables=(x, y))
 
-    def m(self):
+    def m(self) -> M_triangle:
         """
         Return the associated M-triangle.
 
@@ -673,7 +696,7 @@ class F_triangle(Triangle):
         polym = step.numerator()
         return M_triangle(polym, variables=(x, y))
 
-    def parabolic(self):
+    def parabolic(self) -> F_triangle:
         """
         Return a parabolic version of the F-triangle.
 
@@ -726,7 +749,7 @@ class Gamma_triangle(Triangle):
     """
     _prefix = 'Γ'
 
-    def h(self):
+    def h(self) -> H_triangle:
         r"""
         Return the associated H-triangle.
 

sage/combinat/tutorial.py

@@ -141,7 +141,7 @@ We will now attempt a little numerical simulation. The following
 function tests whether a given hand is a flush or not::
 
     sage: def is_flush(hand):
-    ....:     return len(set(suit for (val, suit) in hand)) == 1
+    ....:     return len(set(suit for val, suit in hand)) == 1
 
 We now draw 10000 hands at random, and count the number of flushes
 obtained (this takes about 10 seconds)::
@@ -1636,7 +1636,7 @@ iterator or non-naive counting::
     M(4, 2, 3),
     M(5, 2, 3)
     in 3-d lattice M
-    sage: L.npoints()                                 # random                          # needs palp
+    sage: L.n_points()                                # random                          # needs palp
     11
 
 This polytope can be visualized in 3D with ``L.plot3d()`` (see

sage/combinat/vector_partition.py

@@ -21,7 +21,7 @@ AUTHORS:
 #
 #  The full text of the GPL is available at:
 #
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
 from sage.structure.parent import Parent
@@ -31,9 +31,9 @@ from sage.combinat.combinat import CombinatorialElement
 from sage.combinat.partition import Partition
 
 
-def find_min(vect):
+def find_min(vect) -> list[int]:
     """
-    Return a string of ``0``'s with one ``1`` at the location where the list
+    Return a list of ``0``'s with one ``1`` at the location where the list
     ``vect`` has its last entry which is not equal to ``0``.
 
     INPUT:
@@ -52,13 +52,20 @@ def find_min(vect):
         [0, 1]
         sage: find_min([2, 1, 0])
         [0, 1, 0]
+
+    TESTS::
+
+        sage: find_min([])
+        []
+        sage: find_min([0,0])
+        [0, 0]
     """
     i = len(vect)
-    while vect[i-1] == 0 and i > 0:
-        i = i-1
-    min = [0]*len(vect)
-    if i > 0:
-        min[i-1] = 1
+    min = [0] * i
+    while i > 0 and vect[i - 1] == 0:
+        i -= 1
+    if i:
+        min[i - 1] = 1
     return min
 
 
@@ -91,17 +98,18 @@ def IntegerVectorsIterator(vect, min=None):
     vect = list(vect)
     if not vect:
         yield []
-    else:
-        if min is None:
-            min = [0] * len(vect)
-        if vect < min:
-            return
-        else:
-            for vec in IntegerVectorsIterator(vect[1:], min=min[1:]):
-                yield [min[0]] + vec
-            for j in range(min[0] + 1, vect[0] + 1):
-                for vec in IntegerVectorsIterator(vect[1:]):
-                    yield [j] + vec
+        return
+
+    if min is None:
+        min = [0] * len(vect)
+    if vect < min:
+        return
+
+    for vec in IntegerVectorsIterator(vect[1:], min=min[1:]):
+        yield [min[0]] + vec
+    for j in range(min[0] + 1, vect[0] + 1):
+        for vec in IntegerVectorsIterator(vect[1:]):
+            yield [j] + vec
 
 
 class VectorPartition(CombinatorialElement):
@@ -129,7 +137,7 @@ class VectorPartition(CombinatorialElement):
         P = VectorPartitions(vec)
         return P(vecpar)
 
-    def __init__(self, parent, vecpar):
+    def __init__(self, parent, vecpar) -> None:
         """
         Initialize ``self``.
 
@@ -140,7 +148,7 @@ class VectorPartition(CombinatorialElement):
         """
         CombinatorialElement.__init__(self, parent, sorted(vecpar))
 
-    def sum(self):
+    def sum(self) -> list:
         """
         Return the sum vector as a list.
 
@@ -260,17 +268,20 @@ class VectorPartitions(UniqueRepresentation, Parent):
             min = find_min(vec)  # tuple([0 for v in vec[:-1]]+[1])
         if parts is None:
             parts = list(IntegerVectorsIterator(vec, min=min))
-        if [0]*len(vec) in parts:
-            parts.remove([0]*len(vec))
+        full_zero = [0] * len(vec)
+        if full_zero in parts:
+            parts.remove(full_zero)
         if min in parts:
             min_index = parts.index(min)
             parts = parts[min_index:]
         parts = list(parts)
         for part_index in range(len(parts)):
             parts[part_index] = tuple(parts[part_index])
-        return super().__classcall__(cls, tuple(vec), tuple(min), tuple(parts), distinct, is_repeatable)
+        return super().__classcall__(cls, tuple(vec), tuple(min), tuple(parts),
+                                     distinct, is_repeatable)
 
-    def __init__(self, vec, min=None, parts=None, distinct=False, is_repeatable=None):
+    def __init__(self, vec, min=None, parts=None, distinct=False,
+                 is_repeatable=None) -> None:
         r"""
         Initialize ``self``.
 
@@ -313,25 +324,26 @@ class VectorPartitions(UniqueRepresentation, Parent):
             9
         """
         if all(coord == 0 for coord in self._vec):
-            yield self.element_class(self, []) # the zero vector has only the empty partition
+            yield self.element_class(self, [])  # the zero vector has only the empty partition
         else:
-            for part in self._parts: # choose the first part
+            for part in self._parts:  # choose the first part
                 if tuple(part) == self._vec:
                     yield self.element_class(self, [list(part)])
                 elif any(part[i] > self._vec[i] for i in range(len(self._vec))):
                     pass
-                else:# recursively find all possibilities for the rest of the vector partition
-                    new_vec = tuple(self._vec[i]-part[i] for i in range(len(self._vec)))
+                else:  # recursively find all possibilities for the rest of the vector partition
+                    new_vec = tuple(self._vec[i] - part[i]
+                                    for i in range(len(self._vec)))
                     i = self._parts.index(part)
                     if self._is_repeatable is None:
                         if self._distinct:
-                            new_parts = self._parts[i+1:]
+                            new_parts = self._parts[i + 1:]
                         else:
                             new_parts = self._parts[i:]
                     else:
                         if self._is_repeatable(part):
                             new_parts = self._parts[i:]
                         else:
-                            new_parts = self._parts[i+1:]
+                            new_parts = self._parts[i + 1:]
                     for vecpar in VectorPartitions(new_vec, min=self._min, parts=new_parts, distinct=self._distinct, is_repeatable=self._is_repeatable):
                         yield self.element_class(self, [list(part)] + list(vecpar))

sage/combinat/words/abstract_word.py

@@ -1618,9 +1618,9 @@ class Word_class(SageObject):
             [0, 2, 8]
         """
         if fact.is_empty():
-            raise NotImplementedError("The factor must be non empty")
+            raise NotImplementedError("the factor must be non empty")
         if not fact.is_finite():
-            raise ValueError("The factor must be finite")
+            raise ValueError("the factor must be finite")
         p = self.first_occurrence(fact, start=0)
         while p is not None:
             yield p
@@ -1629,7 +1629,7 @@ class Word_class(SageObject):
     def return_words_iterator(self, fact):
         r"""
         Return an iterator over all the return words of fact in self
-        (without unicity).
+        (without uniqueness).
 
         INPUT:
 
@@ -1675,7 +1675,7 @@ class Word_class(SageObject):
     def complete_return_words_iterator(self, fact):
         r"""
         Return an iterator over all the complete return words of fact in
-        ``self`` (without unicity).
+        ``self`` (without uniqueness).
 
         A complete return words `u` of a factor `v`  is a factor starting
         by the given factor `v` and ending just after the next occurrence

sage/combinat/words/alphabet.py

@@ -29,7 +29,7 @@ EXAMPLES::
 # 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/
 # ****************************************************************************
 
 import collections.abc
@@ -43,17 +43,17 @@ from sage.sets.totally_ordered_finite_set import TotallyOrderedFiniteSet
 
 
 set_of_letters = {
-    'lower'       : "abcdefghijklmnopqrstuvwxyz",
-    'upper'       : "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
-    'space'       : " ",
-    'underscore'  : "_",
-    'punctuation' : " ,.;:!?",
-    'printable'   : "!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~",
-    'binary'      : "01",
-    'octal'       : "01234567",
-    'decimal'     : "0123456789",
-    'hexadecimal' : "0123456789abcdef",
-    'radix64'     : "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"}
+    'lower': "abcdefghijklmnopqrstuvwxyz",
+    'upper': "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
+    'space': " ",
+    'underscore': "_",
+    'punctuation': " ,.;:!?",
+    'printable': "!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~",
+    'binary': "01",
+    'octal': "01234567",
+    'decimal': "0123456789",
+    'hexadecimal': "0123456789abcdef",
+    'radix64': "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"}
 
 
 def build_alphabet(data=None, names=None, name=None):