[Resource Topic] 2024/528: The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences

Welcome to the resource topic for 2024/528

Title:
The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences

Authors: Momonari Kudo, Kazuhiro Yokoyama

Abstract:

Determining the complexity of computing Gröbner bases is an important problem both in theory and in practice, and for that the solving degree plays a key role. In this paper, we study the solving degrees of affine semi-regular sequences and their homogenized sequences. Some of our results are considered to give mathematically rigorous proofs of the correctness of methods for computing Gröbner bases of the ideal generated by an affine semi-regular sequence. This paper is a sequel of the authors’ previous work and gives additional results on the solving degrees and important behaviors of Gröbner basis computation.

ePrint: https://eprint.iacr.org/2024/528

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .