Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

src/sage/rings/polynomial: Link to spkg page by label #37376

Merged
merged 1 commit into from
Feb 25, 2024
Merged

src/sage/rings/polynomial: Link to spkg page by label #37376

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/sage/rings/polynomial/msolve.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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 :ref:`optional package msolve <spkg_msolve>` must be installed.

.. SEEALSO::

Expand Down
8 changes: 4 additions & 4 deletions src/sage/rings/polynomial/multi_polynomial_ideal.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2594,7 +2594,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 :ref:`optional package msolve <spkg_msolve>`
to compute the variety.
See :mod:`~sage.rings.polynomial.msolve` for more information. ::

Expand Down Expand Up @@ -2676,7 +2676,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>`_.
:ref:`optional package msolve <spkg_msolve>`.
Note that msolve uses heuristics and therefore
requires setting the ``proof`` flag to ``False``. See
:mod:`~sage.rings.polynomial.msolve` for more information.
Expand Down Expand Up @@ -4287,7 +4287,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)
:ref:`optional package msolve <spkg_msolve>` (degrevlex order)

``'magma:GroebnerBasis'``
Magma's ``Groebnerbasis`` command (if available)
Expand Down Expand Up @@ -4415,7 +4415,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>`_::
:ref:`optional package msolve <spkg_msolve>`::

sage: R.<a,b,c> = PolynomialRing(GF(101), 3)
sage: I = sage.rings.ideal.Katsura(R,3) # regenerate to prevent caching
Expand Down
Loading