certlin 1.2__tar.gz → 1.3__tar.gz

{certlin-1.2 → certlin-1.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: certlin
-Version: 1.2
+Version: 1.3
 Summary: SageMath package for linear inequality systems and certifying (un)solvability
 Home-page: https://github.com/MarcusAichmayr/certlin
 Author: Marcus S. Aichmayr
@@ -33,7 +33,7 @@ Dynamic: provides-extra
 Dynamic: requires-dist
 Dynamic: summary
 
-# Certlin
+# CertLin
 
 ## Description
 
@@ -50,6 +50,8 @@ LICENSE file), either version 3 or (at your option) any later version
 
 Sage 10.0 or later is recommended.
 
+The package [elementary_vectors](https://github.com/MarcusAichmayr/elementary_vectors) is required.
+
 ## Installation
 
 ### Install from GitHub (recommended)
@@ -91,7 +93,7 @@ Change to the root directory of the repository and run:
 
 The documentation of this package is available on GitHub:
 
-https://marcusaichmayr.github.io/certlin/index.html
+https://marcusaichmayr.github.io/certlin/
 
 To generate it, run
 

{certlin-1.2 → certlin-1.3}/README.md

@@ -1,4 +1,4 @@
-# Certlin
+# CertLin
 
 ## Description
 
@@ -15,6 +15,8 @@ LICENSE file), either version 3 or (at your option) any later version
 
 Sage 10.0 or later is recommended.
 
+The package [elementary_vectors](https://github.com/MarcusAichmayr/elementary_vectors) is required.
+
 ## Installation
 
 ### Install from GitHub (recommended)
@@ -56,7 +58,7 @@ Change to the root directory of the repository and run:
 
 The documentation of this package is available on GitHub:
 
-https://marcusaichmayr.github.io/certlin/index.html
+https://marcusaichmayr.github.io/certlin/
 
 To generate it, run
 

{certlin-1.2 → certlin-1.3}/certlin/__init__.py

@@ -1,7 +1,7 @@
 r"""Certifying linear inequality systems"""
 
 #############################################################################
-#  Copyright (C) 2025                                                       #
+#  Copyright (C) 2026                                                       #
 #          Marcus S. Aichmayr (aichmayr@mathematik.uni-kassel.de)           #
 #                                                                           #
 #  Distributed under the terms of the GNU General Public License (GPL)      #

{certlin-1.2 → certlin-1.3}/certlin/intervals.py

@@ -4,7 +4,7 @@ Intervals
 """
 
 #############################################################################
-#  Copyright (C) 2025                                                       #
+#  Copyright (C) 2026                                                       #
 #          Marcus S. Aichmayr (aichmayr@mathematik.uni-kassel.de)           #
 #                                                                           #
 #  Distributed under the terms of the GNU General Public License (GPL)      #
@@ -108,7 +108,7 @@ class Interval(SageObject):
             return "{}"
         if self.is_pointed():
             return f"{{{self.lower}}}"
-        return f"{'[' if self.lower_closed else '('}{'-oo' if self.lower == minus_infinity else self.lower}, {'+oo' if self.upper == Infinity else self.upper}{']' if self.upper_closed else ')'}"
+        return f"{'[' if self.lower_closed else '('}{'-oo' if self._is_lower_infinite() else self.lower}, {'+oo' if self._is_upper_infinite() else self.upper}{']' if self.upper_closed else ')'}"
 
     def _latex_(self) -> str:
         r"""
@@ -135,9 +135,9 @@ class Interval(SageObject):
             return r"\{" + f"{self.lower}" + r"\}"
         return (
             ("[" if self.lower_closed else "(")
-            + (r"-\infty" if self.lower == minus_infinity else f"{self.lower}")
+            + (r"-\infty" if self._is_lower_infinite() else f"{self.lower}")
             + ", "
-            + (r"\infty" if self.upper == Infinity else f"{self.upper}")
+            + (r"\infty" if self._is_upper_infinite() else f"{self.upper}")
             + ("]" if self.upper_closed else ")")
         )
 
@@ -158,7 +158,13 @@ class Interval(SageObject):
 
     def is_unbounded(self) -> bool:
         r"""Return whether the interval is unbounded."""
-        return self.lower == minus_infinity or self.upper == Infinity
+        return self._is_lower_infinite() or self._is_upper_infinite()
+
+    def _is_lower_infinite(self) -> bool:
+        return self.lower == minus_infinity
+
+    def _is_upper_infinite(self) -> bool:
+        return self.upper == Infinity
 
     def is_bounded(self) -> bool:
         r"""Return whether the interval is bounded."""
@@ -251,8 +257,8 @@ class Interval(SageObject):
             return self.upper
         if self.is_bounded():
             return (self.lower + self.upper) / 2
-        if self.lower == minus_infinity:
-            if self.upper == Infinity:
+        if self._is_lower_infinite():
+            if self._is_upper_infinite():
                 return 0
             return self.upper - 1
         return self.lower + 1
@@ -297,10 +303,10 @@ class Interval(SageObject):
         if 0 in self:
             return 0
         if self.upper - self.lower > 1 or floor(self.lower) + 1 in self or ceil(self.upper) - 1 in self:
-            if self.lower == minus_infinity:
+            if self._is_lower_infinite():
                 floor_upper = floor(self.upper)
                 return floor_upper if floor_upper in self else floor_upper - 1
-            if self.upper == Infinity:
+            if self._is_upper_infinite():
                 ceil_lower = ceil(self.lower)
                 return ceil_lower if ceil_lower in self else ceil_lower + 1
             if self.lower == 0:
@@ -537,7 +543,7 @@ class Intervals(SageObject):
         return cls([Interval.random(ring) for _ in range(length)])
 
     @classmethod
-    def from_bounds(cls, lower_bounds: list, upper_bounds: list, lower_bounds_closed: bool = True, upper_bounds_closed: bool = True) -> Intervals:
+    def from_bounds(cls, lower: list, upper: list, lower_closed: bool = True, upper_closed: bool = True) -> Intervals:
         r"""
         Return intervals that are determined by bounds.
 
@@ -553,20 +559,15 @@ class Intervals(SageObject):
             sage: Intervals.from_bounds([0, -5, 0], [1, 2, +oo], [True, False, True], [True, True, False])
             [0, 1] x (-5, 2] x [0, +oo)
         """
-        length = len(lower_bounds)
-        if lower_bounds_closed is True:
-            lower_bounds_closed = [True] * length
-        elif lower_bounds_closed is False:
-            lower_bounds_closed = [False] * length
-
-        if upper_bounds_closed is True:
-            upper_bounds_closed = [True] * length
-        elif upper_bounds_closed is False:
-            upper_bounds_closed = [False] * length
-
-        return cls([
-            Interval(*bounds)
-            for bounds in zip(
-                lower_bounds, upper_bounds, lower_bounds_closed, upper_bounds_closed
-            )
-        ])
+        length = len(lower)
+        if lower_closed is True:
+            lower_closed = [True] * length
+        elif lower_closed is False:
+            lower_closed = [False] * length
+
+        if upper_closed is True:
+            upper_closed = [True] * length
+        elif upper_closed is False:
+            upper_closed = [False] * length
+
+        return cls([Interval(*bounds) for bounds in zip(lower, upper, lower_closed, upper_closed)])

{certlin-1.2 → certlin-1.3}/certlin/linear_inequality_systems.py

@@ -7,7 +7,7 @@ with methods to find solutions or to certify their nonexistence.
 """
 
 #############################################################################
-#  Copyright (C) 2025                                                       #
+#  Copyright (C) 2026                                                       #
 #          Marcus S. Aichmayr (aichmayr@mathematik.uni-kassel.de)           #
 #                                                                           #
 #  Distributed under the terms of the GNU General Public License (GPL)      #
@@ -28,7 +28,7 @@ from sage.modules.free_module_element import vector, zero_vector
 from sage.rings.infinity import Infinity
 from sage.structure.sage_object import SageObject
 
-from elementary_vectors import ElementaryVectors
+from elementary_vectors import CircuitEnumerator
 from . import Intervals, Interval
 from .utility import CombinationsIncluding, solve_without_division
 
@@ -56,10 +56,10 @@ class LinearInequalitySystem(SageObject):
         [2, 5) x [5, +oo) x (0, 8) x (-oo, 5]
         sage: S = LinearInequalitySystem(M, I)
         sage: S
-        [1 0]  x in  [2, 5)
-        [0 1]  x in  [5, +oo)
-        [1 1]  x in  (0, 8)
-        [0 1]  x in  (-oo, 5]
+        [1 0]  x in [2, 5)
+        [0 1]  x in [5, +oo)
+        [1 1]  x in (0, 8)
+        [0 1]  x in (-oo, 5]
 
     We check for solvability::
 
@@ -69,14 +69,14 @@ class LinearInequalitySystem(SageObject):
         (5/2, 5)
         sage: S.find_solution_random() # random
         (5/2, 5)
-        sage: S.certify_nonexistence()
+        sage: S.certify_unsolvability()
         Traceback (most recent call last):
         ...
-        ValueError: A solution exists!
-        sage: S.certify_nonexistence_random()
+        ValueError: A solution exists.
+        sage: S.certify_unsolvability_random()
         Traceback (most recent call last):
         ...
-        MaxIterationsReachedError: Reached maximum number of iterations! Does a solution exist?
+        MaxIterationsReachedError: Maximum number of iterations reached. A solution might exist.
 
     We rewrite the system as a homogeneous and an inhomogeneous system::
 
@@ -113,14 +113,14 @@ class LinearInequalitySystem(SageObject):
     """
     def __init__(self, matrix: Matrix, intervals: Intervals = None) -> None:
         if intervals is not None and matrix.nrows() != len(intervals):
-            raise ValueError("Matrix row count and number of intervals must agree!")
+            raise ValueError("Matrix row count and number of intervals must agree.")
         self._matrix = matrix
         self._intervals = intervals
-        self._evs = ElementaryVectors(self.matrix.T)
+        self._evs = CircuitEnumerator(self.matrix.T)
 
     def _repr_(self) -> str:
         return "\n".join(
-            f"{row_str}  x in  {interval}"
+            f"{row_str}  x in {interval}"
             for row_str, interval in zip(str(self.matrix).splitlines(), self.intervals)
         )
 
@@ -272,7 +272,7 @@ class LinearInequalitySystem(SageObject):
             return False
         return True
 
-    def certify_nonexistence(self, iteration_limit: int = -1) -> vector:
+    def certify_unsolvability(self, iteration_limit: int = -1) -> vector:
         r"""
         Certify nonexistence of a solution if no solution exists.
 
@@ -291,11 +291,11 @@ class LinearInequalitySystem(SageObject):
         .. SEEALSO::
 
             * :meth:`certify`
-            * :meth:`certify_nonexistence_random`
+            * :meth:`certify_unsolvability_random`
         """
-        return self._certify_nonexistence(random=False, reverse=True, iteration_limit=iteration_limit, stop_event=None)
+        return self._certify_unsolvability(random=False, reverse=True, iteration_limit=iteration_limit, stop_event=None)
 
-    def certify_nonexistence_random(self, iteration_limit: int = 10000) -> vector:
+    def certify_unsolvability_random(self, iteration_limit: int = 10000) -> vector:
         r"""
         Certify nonexistence of a solution using random elementary vectors.
 
@@ -315,11 +315,11 @@ class LinearInequalitySystem(SageObject):
         .. SEEALSO::
 
             * :meth:`certify`
-            * :meth:`certify_nonexistence`
+            * :meth:`certify_unsolvability`
         """
-        return self._certify_nonexistence(random=True, reverse=False, iteration_limit=iteration_limit, stop_event=None)
+        return self._certify_unsolvability(random=True, reverse=False, iteration_limit=iteration_limit, stop_event=None)
 
-    def _certify_nonexistence(self, random: bool, reverse: bool, iteration_limit: int, stop_event) -> vector:
+    def _certify_unsolvability(self, random: bool, reverse: bool, iteration_limit: int, stop_event) -> vector:
         r"""
         Certify nonexistence of a solution.
 
@@ -333,12 +333,12 @@ class LinearInequalitySystem(SageObject):
             if stop_event is not None and stop_event.is_set():
                 raise ProcessStoppedError("Process was stopped because another process found a solution.")
             if iteration_limit != -1 and i >= iteration_limit:
-                raise MaxIterationsReachedError("Reached maximum number of iterations! Does a solution exist?")
+                raise MaxIterationsReachedError("Maximum number of iterations reached. A solution might exist.")
             if v is None:
                 continue
             if not self._exists_orthogonal_vector(v):
                 return v
-        raise ValueError("A solution exists!")
+        raise ValueError("A solution exists.")
 
     def find_solution(self, iteration_limit: int = -1) -> vector:
         r"""
@@ -408,8 +408,8 @@ class LinearInequalitySystem(SageObject):
 
         .. SEEALSO::
 
-            * :meth:`certify_nonexistence`
-            * :meth:`certify_nonexistence_random`
+            * :meth:`certify_unsolvability`
+            * :meth:`certify_unsolvability_random`
             * :meth:`find_solution`
             * :meth:`find_solution_random`
         """
@@ -420,7 +420,7 @@ class LinearInequalitySystem(SageObject):
         stop_event = Manager().Event()
         with ProcessPoolExecutor(max_workers=2) as executor:
             futures = {
-                executor.submit(self._certify_nonexistence, random=random, reverse=True, iteration_limit=iteration_limit, stop_event=stop_event): False,
+                executor.submit(self._certify_unsolvability, random=random, reverse=True, iteration_limit=iteration_limit, stop_event=stop_event): False,
                 executor.submit(self._find_solution, random=random, reverse=False, iteration_limit=iteration_limit, stop_event=stop_event): True,
             }
             for future in as_completed(futures):
@@ -555,7 +555,7 @@ class HomogeneousSystem(LinearInequalitySystem):
             if stop_event is not None and stop_event.is_set():
                 raise ProcessStoppedError("Process was stopped because another process found a certificate for nonexistence.")
             if iteration_limit != -1 and i >= iteration_limit:
-                raise MaxIterationsReachedError("Reached maximum number of iterations! Is system unsolvable?")
+                raise MaxIterationsReachedError("Maximum number of iterations reached. A solution may not exist.")
             if v is None:
                 continue
             for w in [v, -v]:
@@ -568,7 +568,7 @@ class HomogeneousSystem(LinearInequalitySystem):
                     return certificate
                 break
 
-        raise ValueError("No solution exists!")
+        raise ValueError("No solution exists.")
 
 
 class InhomogeneousSystem(LinearInequalitySystem):
@@ -600,9 +600,9 @@ class InhomogeneousSystem(LinearInequalitySystem):
         (False, (1, 0, 1))
         sage: S.certify(random=True)
         (False, (1, 0, 1))
-        sage: S.certify_nonexistence()
+        sage: S.certify_unsolvability()
         (1, 0, 1)
-        sage: S.certify_nonexistence_random() # random
+        sage: S.certify_unsolvability_random() # random
         (1, 0, 1)
 
     Therefore, we cannot find a solution::
@@ -610,11 +610,11 @@ class InhomogeneousSystem(LinearInequalitySystem):
         sage: S.find_solution()
         Traceback (most recent call last):
         ...
-        ValueError: No solution exists!
+        ValueError: No solution exists.
         sage: S.find_solution_random()
         Traceback (most recent call last):
         ...
-        MaxIterationsReachedError: Reached maximum number of iterations! Is system unsolvable?
+        MaxIterationsReachedError: Maximum number of iterations reached. A solution may not exist.
 
     We compute the dual system and write it in homogeneous form::
 

{certlin-1.2 → certlin-1.3}/certlin/utility.py

@@ -4,7 +4,7 @@ Utility functions
 """
 
 #############################################################################
-#  Copyright (C) 2025                                                       #
+#  Copyright (C) 2026                                                       #
 #          Marcus S. Aichmayr (aichmayr@mathematik.uni-kassel.de)           #
 #                                                                           #
 #  Distributed under the terms of the GNU General Public License (GPL)      #
@@ -21,7 +21,7 @@ from sage.matrix.constructor import Matrix
 from sage.modules.free_module_element import vector
 from sage.structure.sage_object import SageObject
 
-from elementary_vectors.functions import circuit_generator
+from elementary_vectors.elements import circuit_generator
 
 
 def solve_without_division(matrix: Matrix, rhs: vector) -> vector:
@@ -68,12 +68,12 @@ def solve_without_division(matrix: Matrix, rhs: vector) -> vector:
         sage: solve_without_division(M, rhs)
         Traceback (most recent call last):
         ...
-        ValueError: No circuit with nonzero last component found. Is there a solution?
+        ValueError: No circuit with nonzero last component found. A solution might exist.
     """
     for circuit in circuit_generator(Matrix.block([[matrix, Matrix.column(rhs)]]), reverse=True):
         if circuit[-1] != 0:
             return -sign(circuit[-1]) * circuit[:-1]
-    raise ValueError("No circuit with nonzero last component found. Is there a solution?")
+    raise ValueError("No circuit with nonzero last component found. A solution might exist.")
 
 
 class CombinationsIncluding(SageObject):

{certlin-1.2 → certlin-1.3}/certlin.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: certlin
-Version: 1.2
+Version: 1.3
 Summary: SageMath package for linear inequality systems and certifying (un)solvability
 Home-page: https://github.com/MarcusAichmayr/certlin
 Author: Marcus S. Aichmayr
@@ -33,7 +33,7 @@ Dynamic: provides-extra
 Dynamic: requires-dist
 Dynamic: summary
 
-# Certlin
+# CertLin
 
 ## Description
 
@@ -50,6 +50,8 @@ LICENSE file), either version 3 or (at your option) any later version
 
 Sage 10.0 or later is recommended.
 
+The package [elementary_vectors](https://github.com/MarcusAichmayr/elementary_vectors) is required.
+
 ## Installation
 
 ### Install from GitHub (recommended)
@@ -91,7 +93,7 @@ Change to the root directory of the repository and run:
 
 The documentation of this package is available on GitHub:
 
-https://marcusaichmayr.github.io/certlin/index.html
+https://marcusaichmayr.github.io/certlin/
 
 To generate it, run
 

{certlin-1.2 → certlin-1.3}/setup.py

@@ -9,7 +9,7 @@ def readfile(filename):
 
 setup(
     name="certlin",
-    version="1.2",
+    version="1.3",
     description="SageMath package for linear inequality systems and certifying (un)solvability",
     long_description=readfile("README.md"),
     long_description_content_type="text/markdown",