passagemath-graphs 10.5.39__tar.gz → 10.5.41__tar.gz

{passagemath_graphs-10.5.39/passagemath_graphs.egg-info → passagemath_graphs-10.5.41}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.5.39
+Version: 10.5.41
 Summary: passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -29,9 +29,9 @@ Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.14,>=3.9
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
-Requires-Dist: cysignals==1.12.0rc2
+Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories~=10.5.39.0
+Requires-Dist: passagemath-categories~=10.5.41.0
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene

passagemath_graphs-10.5.41/VERSION.txt

@@ -0,0 +1 @@
+10.5.41

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41/passagemath_graphs.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.5.39
+Version: 10.5.41
 Summary: passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -29,9 +29,9 @@ Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.14,>=3.9
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
-Requires-Dist: cysignals==1.12.0rc2
+Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories~=10.5.39.0
+Requires-Dist: passagemath-categories~=10.5.41.0
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/passagemath_graphs.egg-info/requires.txt

@@ -1,7 +1,7 @@
 gmpy2~=2.1.b999
-cysignals==1.12.0rc2
+cysignals!=1.12.0,>=1.11.2
 memory_allocator
-passagemath-categories~=10.5.39.0
+passagemath-categories~=10.5.41.0
 
 [benzene]
 passagemath-benzene

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/pyproject.toml

@@ -3,13 +3,13 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-setup ~= 10.5.39.0',
+    'passagemath-setup ~= 10.5.41.0',
     'pkgconfig',
-    'passagemath-environment ~= 10.5.39.0',
-    'passagemath-categories ~= 10.5.39.0',
+    'passagemath-environment ~= 10.5.41.0',
+    'passagemath-categories ~= 10.5.41.0',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'gmpy2 ~=2.1.b999',
-    'cysignals ==1.12.0rc2',
+    'cysignals >=1.11.2, != 1.12.0',
     'memory_allocator',
 ]
 build-backend = "setuptools.build_meta"
@@ -19,9 +19,9 @@ name = "passagemath-graphs"
 description = "passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers"
 dependencies = [
     'gmpy2 ~=2.1.b999',
-    'cysignals ==1.12.0rc2',
+    'cysignals >=1.11.2, != 1.12.0',
     'memory_allocator',
-    'passagemath-categories ~= 10.5.39.0',
+    'passagemath-categories ~= 10.5.41.0',
 ]
 dynamic = ["version"]
 license = "GPL-2.0-or-later"

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/abstract_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Abstract Recursive Trees
+Abstract recursive trees
 
 The purpose of this class is to help implement trees with a specific structure
 on the children of each node. For instance, one could want to define a tree in

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/binary_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 """
-Binary Trees
+Binary trees
 
 This module deals with binary trees as mathematical (in particular immutable)
 objects.

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/cluster_algebra_quiver/all.py

@@ -2,7 +2,7 @@
 r"""
 Cluster algebras and quivers
 
-- A compendium on the cluster algebra and quiver package in Sage [MS2011]_
+A compendium on the cluster algebra and quiver package in Sage [MS2011]_
 
 - :ref:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type`
 - :ref:`sage.combinat.cluster_algebra_quiver.quiver`

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/cluster_algebra_quiver/cluster_seed.py

@@ -1,28 +1,34 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.graphs sage.modules sage.libs.singular
 r"""
-ClusterSeed
+Cluster seeds
 
-A *cluster seed* is a pair `(B,\mathbf{x})` with `B` being a *skew-symmetrizable* `(n+m) \times n` *-matrix*
-and with `\mathbf{x}` being an `n`-tuple of *independent elements* in the field of rational functions in `n` variables.
+A *cluster seed* is a pair `(B,\mathbf{x})` with `B` being a
+*skew-symmetrizable* `(n+m) \times n` *-matrix* and with `\mathbf{x}` being an
+`n`-tuple of *independent elements* in the field of rational functions in `n`
+variables.
 
 For the compendium on the cluster algebra and quiver package see
 [MS2011]_.
 
-AUTHORS:
-
-- Gregg Musiker: Initial Version
-- Christian Stump: Initial Version
-- Aram Dermenjian (2015-07-01): Updating ability to not rely solely on clusters
-- Jesse Levitt (2015-07-01): Updating ability to not rely solely on clusters
-
 REFERENCES:
 
 - [FZ2007]_
-
 - [BDP2013]_
 
-.. SEEALSO:: For mutation types of cluster seeds, see :meth:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type.QuiverMutationType`. Cluster seeds are closely related to :meth:`sage.combinat.cluster_algebra_quiver.quiver.ClusterQuiver`.
+.. SEEALSO::
+
+    For mutation types of cluster seeds, see
+    :meth:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type.QuiverMutationType`.
+    Cluster seeds are closely related to
+    :meth:`sage.combinat.cluster_algebra_quiver.quiver.ClusterQuiver`.
+
+AUTHORS:
+
+- Gregg Musiker: initial version
+- Christian Stump: initial version
+- Aram Dermenjian (2015-07-01): updating ability to not rely solely on clusters
+- Jesse Levitt (2015-07-01): updating ability to not rely solely on clusters
 """
 
 # ****************************************************************************

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/cluster_algebra_quiver/interact.py

@@ -1,4 +1,8 @@
 # sage_setup: distribution = sagemath-graphs
+r"""
+Interactive window for cluster seed mutations
+"""
+
 import ipywidgets as widgets
 from sage.misc.latex import latex
 from sage.repl.rich_output.pretty_print import pretty_print

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/MOLS_handbook_data.py

@@ -1,11 +1,11 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Known lower bounds on the number of Mutually Orthogonal Latin
-Squares (MOLS) of a given size.
+Bounds on the number of mutually orthogonal Latin squares
 
-This module consists (almost) entirely of an internal, constant tuple
-of python integers corresponding to Table 3.87 in the Handbook of
-Combinatorial Designs, 2nd edition, by Colbourn and Dinitz. One public
+This module contains known lower bounds on the number of mutually orthogonal
+Latin squares (MOLS) of a given size, and consists (almost) entirely of an
+internal, constant tuple of Python integers corresponding to Table 3.87 in the
+Handbook of Combinatorial Designs, 2nd edition, by Colbourn and Dinitz. One public
 function, :func:`lower_bound`, is provided to access it.
 
 Make sure we have all of the entries::

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/bibd.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Balanced Incomplete Block Designs (BIBD)
+Balanced incomplete block designs (BIBD)
 
 This module gathers everything related to Balanced Incomplete Block Designs. One can build a
 BIBD (or check that it can be built) with :func:`balanced_incomplete_block_design`::

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/covering_array.py

@@ -1,13 +1,13 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Covering Arrays (CA)
+Covering arrays
 
-A Covering Array, denoted `CA(N;t,k,v)`, is an `N` by `k` array with
+A covering array, denoted `CA(N;t,k,v)`, is an `N` by `k` array with
 entries from a set of `v` elements with the property that in every
 selection of `t` columns, every sequence of `t` elements appears in at
 least one row.
 
-An Orthogonal Array, denoted `OA(N;t,k,v)` is a covering array with the
+An orthogonal array, denoted `OA(N;t,k,v)` is a covering array with the
 property that every sequence of `t`-elements appears in exactly one row.
 (See :mod:`sage.combinat.designs.orthogonal_arrays`).
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/difference_matrices.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Difference Matrices
+Difference matrices
 
 This module gathers code related to difference matrices. One can build those
 objects (or know if they can be built) with :func:`difference_matrix`::

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/ext_rep.py

@@ -1,13 +1,13 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-External Representations of Block Designs
+External representations of block designs
 
-The "ext_rep" module is an API to the abstract tree represented by
+This module is an API to the abstract tree represented by
 an XML document containing the External Representation of a list of
 block designs. The module also provides the related I/O operations for
-reading/writing ext-rep files or data. The parsing is based on expat.
+reading/writing ``ext-rep`` files or data. The parsing is based on expat.
 
-This is a modified form of the module ext_rep.py (version 0.8)
+This is a modified form of the module ``ext_rep.py`` (version 0.8)
 written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
 
 .. TODO::
@@ -16,12 +16,9 @@ written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
     information about things like automorphism groups, transitivity, cycle type
     representatives, etc, but none of this data is made available through the
     current implementation.
-
-Functions
----------
 """
 
-###########################################################################
+# ***********************************************************************
 # This software is released under the terms of the GNU General Public
 # License, version 2 or above (your choice). For details on licensing,
 # see the accompanying documentation.
@@ -29,9 +26,9 @@ Functions
 # This is a modified form of the module ext_rep.py (version 0.8)
 # written by Peter Dobcsanyi peter@designtheory.org.
 #
-# Copyright 2004 by Peter Dobcsanyi peter@designtheory.org, and copyright
-# 2009 Carlo Hamalainen carlo.hamalainen@gmail.com
-###########################################################################
+# Copyright 2004 Peter Dobcsanyi peter@designtheory.org
+#           2009 Carlo Hamalainen carlo.hamalainen@gmail.com
+# ***********************************************************************
 
 import sys
 import xml.parsers.expat
@@ -598,7 +595,6 @@ def _encode_attribute(string):
         sage: _encode_attribute('E')
         'E'
     """
-
     if pattern_integer.match(string):
         return int(string)
     elif pattern_decimal.match(string):
@@ -611,8 +607,7 @@ class XTree:
     '''
     A lazy class to wrap a rooted tree representing an XML document.
     The tree's nodes are tuples of the structure:
-
-        (name, {dictionary of attributes}, [list of children])
+    (name, {dictionary of attributes}, [list of children])
 
     Methods and services of an XTree object ``t``:
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/group_divisible_designs.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Group-Divisible Designs (GDD)
+Group-divisible designs (GDD)
 
 This module gathers everything related to Group-Divisible Designs. The
 constructions defined here can be accessed through ``designs.<tab>``::

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/latin_squares.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Mutually Orthogonal Latin Squares (MOLS)
+Mutually orthogonal Latin squares (MOLS)
 
 The main function of this module is :func:`mutually_orthogonal_latin_squares`
 and can be can be used to generate MOLS (or check that they exist)::

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/resolvable_bibd.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Resolvable Balanced Incomplete Block Design (RBIBD)
+Resolvable balanced incomplete block design (RBIBD)
 
 This module contains everything related to resolvable Balanced Incomplete Block
 Designs. The constructions implemented here can be obtained through the

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/designs/steiner_quadruple_systems.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Steiner Quadruple Systems
+Steiner quadruple systems
 
 A Steiner Quadruple System on `n` points is a family `SQS_n \subset \binom {[n]}
 4` of `4`-sets, such that any set `S\subset [n]` of size three is a subset of

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/finite_state_machine_generators.py

@@ -1,9 +1,9 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.graphs sage.modules
 r"""
-Common Automata and Transducers (Finite State Machines Generators)
+Common automata and transducers (finite state machines generators)
 
-Automata and Transducers in Sage can be built through the
+Automata and transducers in Sage can be built through the
 :class:`automata <AutomatonGenerators>`
 and :class:`transducers <TransducerGenerators>` objects, respectively.
 It contains generators for

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/graph_path.py

@@ -1,8 +1,8 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Paths in Directed Acyclic Graphs
+Paths in directed acyclic graphs
 """
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2007 Mike Hansen <mhansen@gmail.com>,
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -15,7 +15,7 @@ Paths in Directed Acyclic Graphs
 #  The full text of the GPL is available at:
 #
 #                  http://www.gnu.org/licenses/
-#*****************************************************************************
+# ****************************************************************************
 
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.structure.parent import Parent

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/ordered_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 """
-Ordered Rooted Trees
+Ordered rooted trees
 
 AUTHORS:
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/cartesian_product.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 """
-Cartesian products of Posets
+Cartesian products of posets
 
 AUTHORS:
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/d_complete.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-D-Complete Posets
+D-complete posets
 
 AUTHORS:
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/forest.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Forest Posets
+Forest posets
 
 AUTHORS:
 

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/incidence_algebras.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Incidence Algebras
+Incidence algebras
 """
 # ****************************************************************************
 #       Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/linear_extensions.py

@@ -1,16 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Linear Extensions of Posets
-
-This module defines two classes:
-
-- :class:`LinearExtensionOfPoset`
-- :class:`LinearExtensionsOfPoset`
-- :class:`LinearExtensionsOfPosetWithHooks`
-- :class:`LinearExtensionsOfForest`
-
-Classes and methods
--------------------
+Linear extensions of posets
 """
 # ****************************************************************************
 #       Copyright (C) 2012 Anne Schilling <anne at math.ucdavis.edu>

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/posets/moebius_algebra.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Möbius Algebras
+Möbius algebras
 """
 # ****************************************************************************
 #       Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>,

{passagemath_graphs-10.5.39 → passagemath_graphs-10.5.41}/sage/combinat/rooted_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Rooted (Unordered) Trees
+Rooted (unordered) trees
 
 AUTHORS:
 

passagemath_graphs-10.5.39/VERSION.txt

@@ -1 +0,0 @@
-10.5.39