From 3cb7058819e0e326efe3f16bfab21fe62e493d3a Mon Sep 17 00:00:00 2001 From: Dima Pasechnik Date: Tue, 31 Oct 2023 13:49:05 +0000 Subject: [PATCH 1/3] fix the links to msolve spkg --- src/sage/rings/polynomial/msolve.py | 2 +- src/sage/rings/polynomial/multi_polynomial_ideal.py | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/src/sage/rings/polynomial/msolve.py b/src/sage/rings/polynomial/msolve.py index 70af8250f58..378177a02d2 100644 --- a/src/sage/rings/polynomial/msolve.py +++ b/src/sage/rings/polynomial/msolve.py @@ -8,7 +8,7 @@ This module provide implementations of some operations on polynomial ideals based on msolve. -Note that the `optional package msolve <../spkg/msolve.html>`_ must be installed. +Note that the `optional package msolve <../../../spkg/msolve.html>`_ must be installed. .. SEEALSO:: diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py index 66dd4a6db3d..893506ef220 100644 --- a/src/sage/rings/polynomial/multi_polynomial_ideal.py +++ b/src/sage/rings/polynomial/multi_polynomial_ideal.py @@ -2585,7 +2585,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True {y: 0.3611030805286474?, x: 2.769292354238632?}, {y: 1, x: 1}] - We can also use the `optional package msolve <../spkg/msolve.html>`_ + We can also use the `optional package msolve <../../../spkg/msolve.html>`_ to compute the variety. See :mod:`~sage.rings.polynomial.msolve` for more information. :: @@ -2667,7 +2667,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True on a toy implementation otherwise. - With ``algorithm`` = ``"msolve"``, uses the - `optional package msolve <../spkg/msolve.html>`_. + `optional package msolve <../../../spkg/msolve.html>`_. Note that msolve uses heuristics and therefore requires setting the ``proof`` flag to ``False``. See :mod:`~sage.rings.polynomial.msolve` for more information. @@ -4275,7 +4275,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available) ``'msolve'`` - `optional package msolve <../spkg/msolve.html>`_ (degrevlex order) + `optional package msolve <../../../spkg/msolve.html>`_ (degrevlex order) ``'magma:GroebnerBasis'`` Magma's ``Groebnerbasis`` command (if available) @@ -4403,7 +4403,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal b*c - 19*c^2 + 10*b + 40*c, a + 2*b + 2*c - 1] Over prime fields of small characteristic, we can also use the - `optional package msolve <../spkg/msolve.html>`_:: + `optional package msolve <../../../spkg/msolve.html>`_:: sage: R. = PolynomialRing(GF(101), 3) sage: I = sage.rings.ideal.Katsura(R,3) # regenerate to prevent caching From d4b9c9d26aecfef1ede47111dcf7407e73f4c1c2 Mon Sep 17 00:00:00 2001 From: Dima Pasechnik Date: Tue, 31 Oct 2023 19:15:57 +0000 Subject: [PATCH 2/3] just remove ../../ things --- src/sage/rings/polynomial/msolve.py | 2 +- src/sage/rings/polynomial/multi_polynomial_ideal.py | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/src/sage/rings/polynomial/msolve.py b/src/sage/rings/polynomial/msolve.py index 378177a02d2..7d9a8a7c9b9 100644 --- a/src/sage/rings/polynomial/msolve.py +++ b/src/sage/rings/polynomial/msolve.py @@ -8,7 +8,7 @@ This module provide implementations of some operations on polynomial ideals based on msolve. -Note that the `optional package msolve <../../../spkg/msolve.html>`_ must be installed. +Note that the `optional package msolve `_ must be installed. .. SEEALSO:: diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py index 893506ef220..7c5749044ee 100644 --- a/src/sage/rings/polynomial/multi_polynomial_ideal.py +++ b/src/sage/rings/polynomial/multi_polynomial_ideal.py @@ -2585,7 +2585,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True {y: 0.3611030805286474?, x: 2.769292354238632?}, {y: 1, x: 1}] - We can also use the `optional package msolve <../../../spkg/msolve.html>`_ + We can also use the `optional package msolve `_ to compute the variety. See :mod:`~sage.rings.polynomial.msolve` for more information. :: @@ -2667,7 +2667,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True on a toy implementation otherwise. - With ``algorithm`` = ``"msolve"``, uses the - `optional package msolve <../../../spkg/msolve.html>`_. + `optional package msolve `_. Note that msolve uses heuristics and therefore requires setting the ``proof`` flag to ``False``. See :mod:`~sage.rings.polynomial.msolve` for more information. @@ -4275,7 +4275,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available) ``'msolve'`` - `optional package msolve <../../../spkg/msolve.html>`_ (degrevlex order) + `optional package msolve `_ (degrevlex order) ``'magma:GroebnerBasis'`` Magma's ``Groebnerbasis`` command (if available) @@ -4403,7 +4403,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal b*c - 19*c^2 + 10*b + 40*c, a + 2*b + 2*c - 1] Over prime fields of small characteristic, we can also use the - `optional package msolve <../../../spkg/msolve.html>`_:: + `optional package msolve `_:: sage: R. = PolynomialRing(GF(101), 3) sage: I = sage.rings.ideal.Katsura(R,3) # regenerate to prevent caching From 7350ac39658777277532bbedac9eb0c61358e22f Mon Sep 17 00:00:00 2001 From: Dima Pasechnik Date: Tue, 31 Oct 2023 20:53:59 +0000 Subject: [PATCH 3/3] try more ../ --- src/sage/rings/polynomial/msolve.py | 2 +- src/sage/rings/polynomial/multi_polynomial_ideal.py | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/src/sage/rings/polynomial/msolve.py b/src/sage/rings/polynomial/msolve.py index 7d9a8a7c9b9..1905d0a8a57 100644 --- a/src/sage/rings/polynomial/msolve.py +++ b/src/sage/rings/polynomial/msolve.py @@ -8,7 +8,7 @@ This module provide implementations of some operations on polynomial ideals based on msolve. -Note that the `optional package msolve `_ must be installed. +Note that the `optional package msolve <../../../../spkg/msolve.html>`_ must be installed. .. SEEALSO:: diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py index 7c5749044ee..a752af29e75 100644 --- a/src/sage/rings/polynomial/multi_polynomial_ideal.py +++ b/src/sage/rings/polynomial/multi_polynomial_ideal.py @@ -2585,7 +2585,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True {y: 0.3611030805286474?, x: 2.769292354238632?}, {y: 1, x: 1}] - We can also use the `optional package msolve `_ + We can also use the `optional package msolve <../../../../spkg/msolve.html>`_ to compute the variety. See :mod:`~sage.rings.polynomial.msolve` for more information. :: @@ -2667,7 +2667,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True on a toy implementation otherwise. - With ``algorithm`` = ``"msolve"``, uses the - `optional package msolve `_. + `optional package msolve <../../../../spkg/msolve.html>`_. Note that msolve uses heuristics and therefore requires setting the ``proof`` flag to ``False``. See :mod:`~sage.rings.polynomial.msolve` for more information. @@ -4275,7 +4275,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available) ``'msolve'`` - `optional package msolve `_ (degrevlex order) + `optional package msolve <../../../../spkg/msolve.html>`_ (degrevlex order) ``'magma:GroebnerBasis'`` Magma's ``Groebnerbasis`` command (if available) @@ -4403,7 +4403,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal b*c - 19*c^2 + 10*b + 40*c, a + 2*b + 2*c - 1] Over prime fields of small characteristic, we can also use the - `optional package msolve `_:: + `optional package msolve <../../../../spkg/msolve.html>`_:: sage: R. = PolynomialRing(GF(101), 3) sage: I = sage.rings.ideal.Katsura(R,3) # regenerate to prevent caching