passagemath-graphs 10.5.10__cp39-cp39-macosx_14_0_arm64.whl → 10.5.43__cp39-cp39-macosx_14_0_arm64.whl

sage/combinat/posets/posets.py

@@ -293,7 +293,6 @@ from itertools import product
 from sage.misc.cachefunc import cached_method
 from sage.misc.lazy_attribute import lazy_attribute
 from sage.misc.misc_c import prod
-from sage.arith.misc import binomial
 from sage.categories.category import Category
 from sage.categories.sets_cat import Sets
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
@@ -700,15 +699,12 @@ def Poset(data=None, element_labels=None, cover_relations=False, linear_extensio
             if element_labels is not None:
                 P = P.relabel(element_labels)
             return P
-        else:
-            if element_labels is None:
-                return FinitePoset(data, elements=data._elements, category=category, facade=facade)
-            else:
-                return FinitePoset(data, elements=element_labels, category=category, facade=facade)
+        if element_labels is None:
+            return FinitePoset(data, elements=data._elements, category=category, facade=facade)
+        return FinitePoset(data, elements=element_labels, category=category, facade=facade)
 
     # Convert data to a DiGraph
     elements = None
-    D = {}
     if data is None:  # type 0
         D = DiGraph()
     elif isinstance(data, DiGraph):  # type 4
@@ -914,6 +910,8 @@ class FinitePoset(UniqueRepresentation, Parent):
         sage: Q = Poset([[1,2],[],[1]])
         sage: Q == P
         False
+
+        sage: # needs nauty
         sage: p1, p2 = Posets(2).list()
         sage: p2 == p1, p1 != p2
         (False, True)
@@ -927,9 +925,9 @@ class FinitePoset(UniqueRepresentation, Parent):
          [False, False, True, False, False],
          [False, False, False, True, False],
          [False, False, False, False, True]]
-
         sage: [[p1.__ne__(p2) for p1 in Posets(2)] for p2 in Posets(2)]
         [[False, True], [True, False]]
+
         sage: P = Poset([[1,2,4],[3],[3]])
         sage: Q = Poset([[1,2],[],[1],[4]])
         sage: P != Q
@@ -938,7 +936,7 @@ class FinitePoset(UniqueRepresentation, Parent):
         False
         sage: Q != Q
         False
-        sage: [[p1.__ne__(p2) for p1 in Posets(2)] for p2 in Posets(2)]
+        sage: [[p1.__ne__(p2) for p1 in Posets(2)] for p2 in Posets(2)]                 # needs nauty
         [[False, True], [True, False]]
 
         sage: P = Poset((divisors(12), attrcall("divides")), linear_extension=True)
@@ -1530,10 +1528,11 @@ class FinitePoset(UniqueRepresentation, Parent):
             sage: P.sorted([], allow_incomparable=False, remove_duplicates=False)
             []
         """
-        v = [self._element_to_vertex(x) for x in l]
+        v = (self._element_to_vertex(x) for x in l)
         if remove_duplicates:
-            v = set(v)
-        o = sorted(v)
+            o = sorted(set(v))
+        else:
+            o = sorted(v)
 
         if not allow_incomparable:
             H = self._hasse_diagram
@@ -1818,7 +1817,7 @@ class FinitePoset(UniqueRepresentation, Parent):
         for r in range(1, n + 1):
             new_a_spec.append(0)
             for i in range(max(1, r - n + k), min(r, k) + 1):
-                k_val = binomial(r - 1, i - 1) * binomial(n - r, k - i)
+                k_val = Integer(r - 1).binomial(i - 1) * Integer(n - r).binomial(k - i)
                 new_a_spec[-1] += k_val * a_spec[i - 1] * n_lin_exts
         return new_a_spec
 
@@ -2059,10 +2058,10 @@ class FinitePoset(UniqueRepresentation, Parent):
                   'cover_colors': 'edge_colors',
                   'cover_style': 'edge_style',
                   'border': 'graph_border'}
-        for param in rename:
+        for param, value in rename.items():
             tmp = kwds.pop(param, None)
             if tmp is not None:
-                kwds[rename[param]] = tmp
+                kwds[value] = tmp
 
         heights = kwds.pop('heights', None)
         if heights is None:
@@ -2587,10 +2586,10 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         covers = []
         for a, b in ints:
-            covers.extend([[(a, b), (a, bb)] for bb in self.upper_covers(b)])
+            covers.extend([(a, b), (a, bb)] for bb in self.upper_covers(b))
             if a != b:
-                covers.extend([[(a, b), (aa, b)] for aa in self.upper_covers(a)
-                               if self.le(aa, b)])
+                covers.extend([(a, b), (aa, b)] for aa in self.upper_covers(a)
+                              if self.le(aa, b))
 
         dg = DiGraph([ints, covers], format='vertices_and_edges')
         return constructor(dg, cover_relations=True)
@@ -2717,10 +2716,9 @@ class FinitePoset(UniqueRepresentation, Parent):
                 for y in H.neighbor_out_iterator(xmax):
                     if exposant == 1:
                         next_stock.append((xmin, y, y))
-                    else:
-                        if (cov_xmin, y) in short_stock:
-                            if H.is_linear_interval(xmin, y):
-                                next_stock.append((xmin, cov_xmin, y))
+                    elif (cov_xmin, y) in short_stock:
+                        if H.is_linear_interval(xmin, y):
+                            next_stock.append((xmin, cov_xmin, y))
             if next_stock:
                 poly.append(len(next_stock))
                 stock = next_stock
@@ -2857,12 +2855,12 @@ class FinitePoset(UniqueRepresentation, Parent):
             closure = self._hasse_diagram.transitive_closure()
         for m, n in chain_pairs:
             try:
-                m, n = Integer(m), Integer(n)
+                ZZm, ZZn = Integer(m), Integer(n)
             except TypeError:
                 raise TypeError(f"{m} and {n} must be integers")
             if m < 1 or n < 1:
                 raise ValueError(f"{m} and {n} must be positive integers")
-            twochains = digraphs.TransitiveTournament(m) + digraphs.TransitiveTournament(n)
+            twochains = digraphs.TransitiveTournament(ZZm) + digraphs.TransitiveTournament(ZZn)
             if closure.subgraph_search(twochains, induced=True) is not None:
                 return False
         return True
@@ -3212,7 +3210,7 @@ class FinitePoset(UniqueRepresentation, Parent):
             sage: N5.has_isomorphic_subposet(D)
             True
 
-            sage: len([P for P in Posets(5) if P.has_isomorphic_subposet(D)])
+            sage: len([P for P in Posets(5) if P.has_isomorphic_subposet(D)])           # needs nauty
             11
         """
         if not hasattr(other, 'hasse_diagram'):
@@ -3246,7 +3244,7 @@ class FinitePoset(UniqueRepresentation, Parent):
             False
             sage: Poset({1:[]}).is_bounded()  # Here top == bottom
             True
-            sage: ( len([P for P in Posets(5) if P.is_bounded()]) ==
+            sage: ( len([P for P in Posets(5) if P.is_bounded()]) ==                    # needs nauty
             ....: Posets(3).cardinality() )
             True
         """
@@ -3273,7 +3271,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         TESTS::
 
-            sage: [len([P for P in Posets(n) if P.is_chain()]) for n in range(5)]
+            sage: [len([P for P in Posets(n) if P.is_chain()]) for n in range(5)]       # needs nauty
             [1, 1, 1, 1, 1]
         """
         return self._hasse_diagram.is_chain()
@@ -4398,7 +4396,7 @@ class FinitePoset(UniqueRepresentation, Parent):
            [1, 1, 1, 1, x^5 + x^4 + x + 1]
            sage: P.coxeter_smith_form(algorithm='gap')                                  # needs sage.libs.gap
            [1, 1, 1, 1, x^5 + x^4 + x + 1]
-           sage: P.coxeter_smith_form(algorithm='pari')                                 # needs sage.libs.pari
+           sage: P.coxeter_smith_form(algorithm='pari')                                 # needs sage.libs.flint sage.libs.pari
            [1, 1, 1, 1, x^5 + x^4 + x + 1]
            sage: P.coxeter_smith_form(algorithm='fricas')       # optional - fricas
            [1, 1, 1, 1, x^5 + x^4 + x + 1]
@@ -4500,7 +4498,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
             sage: Poset().is_meet_semilattice()  # Test empty lattice
             True
-            sage: len([P for P in Posets(4) if P.is_meet_semilattice()])
+            sage: len([P for P in Posets(4) if P.is_meet_semilattice()])                # needs nauty
             5
 
             sage: P = Poset({1: [2], 3: []})
@@ -4571,7 +4569,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
             sage: Poset().is_join_semilattice()  # Test empty lattice
             True
-            sage: len([P for P in Posets(4) if P.is_join_semilattice()])
+            sage: len([P for P in Posets(4) if P.is_join_semilattice()])                # needs nauty
             5
 
             sage: X = Poset({1: [3], 2: [3], 3: [4, 5]})
@@ -5299,7 +5297,7 @@ class FinitePoset(UniqueRepresentation, Parent):
         dg = self._hasse_diagram
         if not dg.is_connected():
             raise NotImplementedError('the poset is not connected')
-        if ZZ(dg.num_verts()).is_prime():
+        if Integer(dg.num_verts()).is_prime():
             return [self]
         G = dg.to_undirected()
         is_product, dic = G.is_cartesian_product(relabeling=True)
@@ -5310,7 +5308,7 @@ class FinitePoset(UniqueRepresentation, Parent):
         prod_dg = dg.relabel(dic, inplace=False)
         v0 = next(iter(dic.values()))
         n = len(v0)
-        factors_range = list(range(n))
+        factors_range = range(n)
         fusion = Graph(n)
 
         def edge_color(va, vb):
@@ -5325,9 +5323,9 @@ class FinitePoset(UniqueRepresentation, Parent):
                 neigh1 = [z for z in prod_dg.neighbor_iterator(x)
                           if edge_color(x, z) == i1]
                 for x0, x1 in product(neigh0, neigh1):
-                    x2 = list(x0)
-                    x2[i1] = x1[i1]
-                    x2 = tuple(x2)
+                    _x2 = list(x0)
+                    _x2[i1] = x1[i1]
+                    x2 = tuple(_x2)
                     A0 = prod_dg.has_edge(x, x0)
                     B0 = prod_dg.has_edge(x1, x2)
                     if A0 != B0:
@@ -6496,7 +6494,7 @@ class FinitePoset(UniqueRepresentation, Parent):
                 with seed(currseed):
                     for _ in range(count):
                         for element in range(n):
-                            if random() % 2 == 1:
+                            if random() % 2:  # should use one random bit
                                 s = [state[i] for i in lower_covers[element]]
                                 if 1 not in s:
                                     if 2 not in s:
@@ -6531,7 +6529,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_maximal_chain()
             [0, 4, 5, 7, 15]
@@ -6566,7 +6564,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_maximal_antichain()
             [1, 8, 2, 4]
@@ -6598,7 +6596,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_linear_extension()
             [0, 4, 1, 2, 3, 8, 10, 5, 12, 9, 13, 11, 6, 14, 7, 15]
@@ -7172,12 +7170,12 @@ class FinitePoset(UniqueRepresentation, Parent):
             True
         """
         from sage.geometry.polyhedron.constructor import Polyhedron
-        ineqs = [[0] + [ZZ(j == v) - ZZ(j == u) for j in self]
+        ineqs = [[0] + [Integer(j == v) - Integer(j == u) for j in self]
                  for u, v in self.hasse_diagram().edges(sort=False, labels=False)]
         for i in self.maximal_elements():
-            ineqs += [[1] + [-ZZ(j == i) for j in self]]
+            ineqs += [[1] + [-Integer(j == i) for j in self]]
         for i in self.minimal_elements():
-            ineqs += [[0] + [ZZ(j == i) for j in self]]
+            ineqs += [[0] + [Integer(j == i) for j in self]]
         return Polyhedron(ieqs=ineqs, base_ring=ZZ)
 
     def chain_polytope(self):
@@ -7211,10 +7209,10 @@ class FinitePoset(UniqueRepresentation, Parent):
             A 5-dimensional polyhedron in ZZ^5 defined as the convex hull of 8 vertices
         """
         from sage.geometry.polyhedron.constructor import Polyhedron
-        ineqs = [[1] + [-ZZ(j in chain) for j in self]
+        ineqs = [[1] + [-Integer(j in chain) for j in self]
                  for chain in self.maximal_chains_iterator()]
         for i in self:
-            ineqs += [[0] + [ZZ(j == i) for j in self]]
+            ineqs += [[0] + [Integer(j == i) for j in self]]
         return Polyhedron(ieqs=ineqs, base_ring=ZZ)
 
     def zeta_polynomial(self):
@@ -7243,15 +7241,14 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
+            sage: # needs sage.libs.flint
             sage: posets.ChainPoset(2).zeta_polynomial()
             q
             sage: posets.ChainPoset(3).zeta_polynomial()
             1/2*q^2 + 1/2*q
-
             sage: P = posets.PentagonPoset()
             sage: P.zeta_polynomial()
             1/6*q^3 + q^2 - 1/6*q
-
             sage: P = posets.DiamondPoset(5)
             sage: P.zeta_polynomial()
             3/2*q^2 - 1/2*q
@@ -7260,6 +7257,7 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         Checking the simplest cases::
 
+            sage: # needs sage.libs.flint
             sage: Poset({}).zeta_polynomial()
             0
             sage: Poset({1: []}).zeta_polynomial()
@@ -7657,28 +7655,27 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
+            sage: # needs sage.libs.flint
             sage: P = posets.ChainPoset(3)
             sage: t = P.chain_polynomial(); t
             q^3 + 3*q^2 + 3*q + 1
             sage: t(1) == len(list(P.chains()))
             True
-
             sage: P = posets.BooleanLattice(3)
             sage: P.chain_polynomial()
             6*q^4 + 18*q^3 + 19*q^2 + 8*q + 1
-
             sage: P = posets.AntichainPoset(5)
             sage: P.chain_polynomial()
             5*q + 1
 
         TESTS::
 
+            sage: # needs sage.libs.flint
             sage: P = Poset()
             sage: P.chain_polynomial()
             1
             sage: parent(P.chain_polynomial())
             Univariate Polynomial Ring in q over Integer Ring
-
             sage: R = Poset({1: []})
             sage: R.chain_polynomial()
             q + 1
@@ -7699,10 +7696,10 @@ class FinitePoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
+            sage: # needs sage.libs.flint
             sage: P = posets.AntichainPoset(3)
             sage: P.order_polynomial()
             q^3
-
             sage: P = posets.ChainPoset(3)
             sage: f = P.order_polynomial(); f
             1/6*q^3 + 1/2*q^2 + 1/3*q
@@ -8145,7 +8142,7 @@ class FinitePoset(UniqueRepresentation, Parent):
         n = self.cardinality()
         if n == 1:
             return True
-        if k is None and not certificate and n % 2 == 1:
+        if k is None and not certificate and n % 2:
             return False
 
         H = self._hasse_diagram
@@ -8881,6 +8878,7 @@ class FinitePosets_n(UniqueRepresentation, Parent):
 
     EXAMPLES::
 
+        sage: # needs nauty
         sage: P = Posets(3)
         sage: P.cardinality()
         5
@@ -8902,7 +8900,7 @@ class FinitePosets_n(UniqueRepresentation, Parent):
             Category of finite enumerated sets
             sage: P.__class__
             <class 'sage.combinat.posets.posets.FinitePosets_n_with_category'>
-            sage: TestSuite(P).run()
+            sage: TestSuite(P).run()                                                    # needs nauty
         """
         Parent.__init__(self, category=FiniteEnumeratedSets())
         self._n = n
@@ -8945,13 +8943,13 @@ class FinitePosets_n(UniqueRepresentation, Parent):
         EXAMPLES::
 
             sage: P = Posets(2)
-            sage: list(P)
+            sage: list(P)                                                               # needs nauty
             [Finite poset containing 2 elements, Finite poset containing 2 elements]
 
         TESTS::
 
-            sage: it = iter(Posets(17))
-            sage: next(it)
+            sage: it = iter(Posets(17))                                                 # needs nauty
+            sage: next(it)                                                              # needs nauty
             Finite poset containing 17 elements
         """
         if self._n <= 16:
@@ -8981,7 +8979,7 @@ class FinitePosets_n(UniqueRepresentation, Parent):
             sage: P = Posets(3)
             sage: P.cardinality()
             5
-            sage: P.cardinality(from_iterator=True)
+            sage: P.cardinality(from_iterator=True)                                     # needs nauty
             5
         """
         # Obtained from The On-Line Encyclopedia of Integer Sequences;

sage/combinat/rooted_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Rooted (Unordered) Trees
+Rooted (unordered) trees
 
 AUTHORS:
 
@@ -193,8 +193,8 @@ class RootedTree(AbstractClonableTree, NormalizedClonableList,
             children = list(children)
         except TypeError:
             raise TypeError(f"input ({children}) is not a valid tree")
-        #if not (children.__class__ is self.__class__
-        #        and children.parent() == parent):
+        # if not (children.__class__ is self.__class__
+        #         and children.parent() == parent):
         children = [self.__class__(parent, x) for x in children]
         NormalizedClonableList.__init__(self, parent, children, check=check)
 

sage/combinat/tamari_lattices.py

@@ -365,7 +365,7 @@ def DexterSemilattice(n):
         15
         sage: len(P.maximal_elements())
         4
-        sage: P.chain_polynomial()
+        sage: P.chain_polynomial()                                                      # needs sage.libs.flint
         q^5 + 19*q^4 + 47*q^3 + 42*q^2 + 14*q + 1
 
     REFERENCES:

sage/ext_data/kenzo/CP2.txt

@@ -0,0 +1,45 @@
+* (show-structure ssz4 6)
+
+Dimension = 0:
+
+        Vertices :  (<<GBar>>)
+
+Dimension = 1:
+
+Dimension = 2:
+
+        Simplex : <<GBar<- (2)><- NIL>>>
+
+                Faces : (<AbSm 0 <<GBar>>> <AbSm 0 <<GBar>>> <AbSm 0 <<GBar>>>)
+
+        Simplex : <<GBar<- (1)><- NIL>>>
+
+                Faces : (<AbSm 0 <<GBar>>> <AbSm 0 <<GBar>>> <AbSm 0 <<GBar>>>)
+
+Dimension = 3:
+
+        Simplex : <<GBar<- (1 1)><0 NIL><- NIL>>>
+
+                Faces : (<AbSm - <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (2)><- NIL>>>> <AbSm - <<GBar<- (1)><- NIL>>>> <AbSm 1-0 <<GBar>>>)
+
+        Simplex : <<GBar<1 (1)><- (1)><- NIL>>>
+
+                Faces : (<AbSm 1-0 <<GBar>>> <AbSm - <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (2)><- NIL>>>> <AbSm - <<GBar<- (1)><- NIL>>>>)
+
+        Simplex : <<GBar<0 (1)><- (1)><- NIL>>>
+
+                Faces : (<AbSm - <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (1)><- NIL>>>>)
+
+Dimension = 4:
+
+        Simplex : <<GBar<1-0 (1)><1-0 NIL><- (1)><- NIL>>>
+
+                Faces : (<AbSm 0 <<GBar<- (1)><- NIL>>>> <AbSm 0 <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<0 (1)><- (1)><- NIL>>>> <AbSm 2 <<GBar<- (1)><- NIL>>>> <AbSm 2 <<GBar<- (1)><- NIL>>>>)
+
+        Simplex : <<GBar<2-0 (1)><1 (1)><0 NIL><- NIL>>>
+
+                Faces : (<AbSm 1 <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<1 (1)><- (1)><- NIL>>>> <AbSm - <<GBar<0 (1)><- (1)><- NIL>>>> <AbSm - <<GBar<- (1 1)><0 NIL><- NIL>>>> <AbSm 1 <<GBar<- (1)><- NIL>>>>)
+
+        Simplex : <<GBar<2-1 (1)><0 (1)><0 NIL><- NIL>>>
+
+                Faces : (<AbSm 2 <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<1 (1)><- (1)><- NIL>>>> <AbSm 1 <<GBar<- (1)><- NIL>>>> <AbSm - <<GBar<- (1 1)><0 NIL><- NIL>>>> <AbSm 0 <<GBar<- (1)><- NIL>>>>)