Analysis of computing Gr\"obner bases and Gr\"obner degenerations via theory of signatures

arXiv2305.13639MaRDI QIDQ6437600FDOQ6437600

Authors: Yuta Kambe 

Publication date: 22 May 2023

Abstract: The signatures of polynomials were originally introduced by Faug`{e}re for the efficient computation of Gr"obner bases [Fau02], and redefined by Arri-Perry [AP11] as the standard monomials modulo the module of syzygies. Since it is difficult to determine signatures, Vaccon-Yokoyama [VY17] introduced an alternative object called guessed signatures. In this paper, we consider a module $mathrmGobs(F)$ consisting of the equivalent classes of the guessed signatures for a tuple of polynomials $F$. This is the residue module $mathrm{ini}_{prec}(mathrmSyz(mathrmLM(F)))/mathrm{ini}_{prec}(mathrmSyz(F))$ defined by the initial modules of the syzygy modules with respect to the Schreyer order. We first show that $F$ is a Gr"obner basis if and only if $mathrmGobs(F)$ is the zero module. Then we find a necessity to compute divisions of S-polynomials to find Gr"obner bases. We give examples of transitions of minimal free resolutions of $mathrmGobs(F)$ in a signature based algorithm. Finally, we show a connection between the module $mathrmGobs(F)$ and Gr"obner degenerations.

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

This page was built for publication: Analysis of computing Gr\"obner bases and Gr\"obner degenerations via theory of signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437600)