passagemath-graphs 10.5.10__cp39-cp39-macosx_14_0_arm64.whl → 10.5.43__cp39-cp39-macosx_14_0_arm64.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/base/boost_graph.pxd

@@ -62,7 +62,7 @@ cdef extern from "boost_interface.cpp":
         v_index num_verts()
         void add_edge(v_index u, v_index v)
         void add_edge(v_index u, v_index v, double w)
-        vector[pair[int, pair[int, double]]] edge_list()
+        vector[pair[v_index, pair[v_index, double]]] edge_list()
         e_index num_edges()
         result_ec edge_connectivity()
         double clustering_coeff(v_index v)

sage/graphs/base/boost_graph.pyx

@@ -1076,7 +1076,7 @@ cdef get_predecessors(BoostWeightedGraph g, result, int_to_v, directed, weight_t
         sage: johnson_shortest_paths(g, distances=False, predecessors=True) == expected
         True
     """
-    cdef vector[pair[int, pair[int, double]]] edges
+    cdef vector[pair[v_index, pair[v_index, double]]] edges
     sig_on()
     edges = g.edge_list()
     sig_off()

sage/graphs/base/c_graph.pxd

@@ -1,10 +1,10 @@
 # sage_setup: distribution = sagemath-graphs
-#**************************************************************************
+# *************************************************************************
 #        Copyright (C) 2008-9 Robert L. Miller <rlmillster@gmail.com>
 #
 # Distributed  under  the  terms  of  the  GNU  General  Public  License (GPL)
-#                         http://www.gnu.org/licenses/
-#**************************************************************************
+#                         https://www.gnu.org/licenses/
+# *************************************************************************
 
 from sage.data_structures.bitset cimport bitset_t
 from sage.graphs.base.graph_backends cimport GenericGraphBackend
@@ -88,7 +88,7 @@ cdef class CGraphBackend(GenericGraphBackend):
     cdef int get_vertex_checked(self, u) except ? -2
     cdef vertex_label(self, int u_int)
     cdef int check_labelled_vertex(self, u, bint reverse) except ? -1
-    #cdef CGraph _cg  # a child class should declare this accordingly
+    # cdef CGraph _cg  # a child class should declare this accordingly
     cdef bint _directed
     cdef dict vertex_labels
     cdef dict vertex_ints