passagemath-graphs 10.5.36__cp312-cp312-manylinux_2_28_aarch64.whl → 10.5.42__cp312-cp312-manylinux_2_28_aarch64.whl

sage/ext_data/kenzo/README.txt

@@ -0,0 +1,49 @@
+These files contain code for producing simplicial set structures for spaces homotopy equivalent to n-dimensional complex projective space, using the algorithm described in "Triangulations of complex projective spaces" by Sergeraert. The f-vectors for these models for CP^n:
+
+n=2:  1  0  2   3   3
+n=3:  1  0  3  10  25   30    15
+n=4:  1  0  4  22  97  255   390   315    105
+n=5:  1  0  5  40 271 1197  3381  5975   6405   3780    945
+n=6:  1  0  6  65 627 4162 18496 54789 107933 139230 112770 51975 10395
+
+Kenzo: 
+- https://www-fourier.ujf-grenoble.fr/~sergerar/Kenzo/
+- https://github.com/gheber/kenzo
+
+The results for CP^2, CP^3, and CP^4 have been saved in the corresponding text files. The file S4.txt includes the 4-sphere, just for testing purposes. These files can be processed by the function "simplicial_data_from_kenzo_output" in sage/topology/simplicial_set.py. To get a simplicial set structure for CP^n using Kenzo in sbcl, do the following. 
+
+;;
+;; Start Kenzo.
+;;
+(require :asdf)
+(require :kenzo)
+(in-package "CAT")
+;;
+;; Define K(Z,2).
+;;
+(setf kz2 (k-z 2))
+;;
+;; Define effective homology version of K(Z,2).
+;;
+(setf efhm-kz2 (efhm kz2))
+;;
+;; The previous command produces output of the form
+;; [K153 Homotopy-Equivalence K13 <= K143 => K139]
+;;
+;; In the following, replace "139" with the right-hand number.
+;; Replace "4" with the desired dimension: 2n if you're constructing
+;; CP^n.
+;;
+;; That is, the point is to find the smallest subcomplex of K(Z,2)
+;; which contains the given homology class. If you replace "4" with
+;; "2n", this should give a complex homotopy equivalent to CP^n.
+;;
+(chcm-homology-gen (k 139) 4)
+(setf g (first *))
+(setf z4 (lf efhm-kz2 (rg efhm-kz2 g)))
+(multiple-value-setq (ssz4 incl) (gmsms-subsmst kz2 z4))
+;;
+;; Now ssz4 is a model for the 4-dimensional complex CP^2, so display
+;; its nondegenerate simplices through dimension 4.
+;;
+(show-structure ssz4 4)

sage/ext_data/kenzo/S4.txt

@@ -0,0 +1,20 @@
+;; The 4-sphere.
+
+* (show-structure S4 4)
+
+
+Dimension = 0:
+
+        Vertices :  (*)
+
+Dimension = 1:
+
+Dimension = 2:
+
+Dimension = 3:
+
+Dimension = 4:
+
+        Simplex : S4
+
+                Faces : (<AbSm 2-1-0 *> <AbSm 2-1-0 *> <AbSm 2-1-0 *> <AbSm 2-1-0 *> <AbSm 2-1-0 *>)

sage/graphs/generators/distance_regular.pyx

@@ -2746,7 +2746,7 @@ def distance_regular_graph(list arr, existence=False, check=True):
         Graph on 1024 vertices
         sage: graphs.distance_regular_graph([6,5,5,5,1,1,1,6])  # optional - database_graphs
         Generalised octagon of order (1, 5): Graph on 312 vertices
-        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)
+        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)         # needs sage.libs.gap
         Graph on 325 vertices
     """
     from sage.misc.unknown import Unknown

sage/graphs/graph.py

@@ -379,7 +379,7 @@ suitable for inclusion in a `\LaTeX` document.  More details on this are at the
 
     sage: from sage.graphs.graph_latex import check_tkz_graph
     sage: check_tkz_graph()  # random - depends on TeX installation
-    sage: latex(G)
+    sage: latex(G)                                                                      # needs sage.plot
     \begin{tikzpicture}
     ...
     \end{tikzpicture}

sage/graphs/graph_list.py

@@ -19,9 +19,6 @@ AUTHORS:
 # ****************************************************************************
 
 
-from sage.misc.misc import try_read
-
-
 def from_whatever(data):
     r"""
     Return a list of Sage Graphs, given a list of whatever kind of data.
@@ -78,6 +75,8 @@ def _from_whatever(data, fmt=None):
     if isinstance(data, str):
         lines = data.splitlines()
     else:
+        from sage.misc.misc import try_read
+
         lines = try_read(data, splitlines=True)
 
         if lines is not None and fmt is None:

sage/sandpiles/sandpile.py

@@ -339,7 +339,6 @@ from sage.graphs.digraph import DiGraph
 from sage.graphs.graph import Graph
 from sage.misc.functional import det, denominator
 from sage.misc.lazy_import import lazy_import
-from sage.misc.misc import exists
 from sage.misc.misc_c import prod
 from sage.misc.temporary_file import tmp_filename
 from sage.rings.integer import Integer
@@ -1542,7 +1541,7 @@ class Sandpile(DiGraph):
         else:
             rec = list(self.recurrents())
             for r in self.recurrents():
-                if exists(rec, lambda x: r > x)[0]:
+                if any(r > x for x in rec):
                     rec.remove(r)
         self._min_recurrents = rec