scholarly journals An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors

2009 ◽  
Vol 2 (4) ◽  
pp. 601-634 ◽  
Author(s):  
Deepak Kapur ◽  
Yongyang Cai
Keyword(s):  
Gröbner Basis ◽  
Polynomial Ideal ◽  
Grobner Basis ◽  
Zero Divisors

scholarly journals Constructing Gröbner bases for Noetherian rings

2013 ◽  
Vol 24 (2) ◽  
Author(s):  
HERVÉ PERDRY ◽  
PETER SCHUSTER
Keyword(s):  
Gröbner Basis ◽  
Finite Depth ◽  
Commutative Rings ◽  
Polynomial Ideal ◽  
Constructive Proof ◽  
Noetherian Rings ◽  
Grobner Basis ◽  
Finitely Generated ◽  
Prime Decomposition ◽  
Separate Paper

We give a constructive proof showing that every finitely generated polynomial ideal has a Gröbner basis, provided the ring of coefficients is Noetherian in the sense of Richman and Seidenberg. That is, we give a constructive termination proof for a variant of the well-known algorithm for computing the Gröbner basis. In combination with a purely order-theoretic result we have proved in a separate paper, this yields a unified constructive proof of the Hilbert basis theorem for all Noether classes: if a ring belongs to a Noether class, then so does the polynomial ring. Our proof can be seen as a constructive reworking of one of the classical proofs, in the spirit of the partial realisation of Hilbert's programme in algebra put forward by Coquand and Lombardi. The rings under consideration need not be commutative, but are assumed to be coherent and strongly discrete: that is, they admit a membership test for every finitely generated ideal. As a complement to the proof, we provide a prime decomposition for commutative rings possessing the finite-depth property.

scholarly journals An extension of Buchberger’s criteria for Gröbner basis decision

2010 ◽  
Vol 13 ◽  
pp. 111-129
Author(s):  
John Perry
Keyword(s):  
Gröbner Basis ◽  
Gröbner Bases ◽  
Characterization Theorem ◽  
Polynomial Systems ◽  
Polynomial Ideal ◽  
Grobner Bases ◽  
Grobner Basis ◽  
Case Scenario ◽  
Worst Case ◽  
New Criterion

AbstractTwo fundamental questions in the theory of Gröbner bases are decision (‘Is a basisGof a polynomial ideal a Gröbner basis?’) and transformation (‘If it is not, how do we transform it into a Gröbner basis?’) This paper considers the first question. It is well known thatGis a Gröbner basis if and only if a certain set of polynomials (theS-polynomials) satisfy a certain property. In general there arem(m−1)/2 of these, wheremis the number of polynomials inG, but criteria due to Buchberger and others often allow one to consider a smaller number. This paper presents two original results. The first is a new characterization theorem for Gröbner bases that makes use of a new criterion that extends Buchberger’s criteria. The second is the identification of a class of polynomial systemsGfor which the new criterion has dramatic impact, reducing the worst-case scenario fromm(m−1)/2 S-polynomials tom−1.

The hypergeometric system for one-loop triangle integral

2019 ◽  
Vol 34 (35) ◽  
pp. 1950232
Author(s):  
Xiu-Yi Yang ◽  
Hong-Na Li
Keyword(s):  
Parameter Space ◽  
Gröbner Basis ◽  
Hypergeometric Series ◽  
Polynomial Ideal ◽  
Convergence Theory ◽  
Grobner Basis ◽  
Convergence Region ◽  
Multiple Series

We derive the holonomic hypergeometric system for the [Formula: see text] function with two equal virtual masses, and present the expression of [Formula: see text] in hypergeometric series in corresponding convergent region. Combining the Horn’s convergence theory with Gröbner basis of polynomial ideal, one can calculate the convergence region of the corresponding multiple series concretely. Using the system given here, one can analytically continue [Formula: see text] to whole parameter space.

Gröbner bases for syzygy modules of border bases

2014 ◽  
Vol 13 (06) ◽  
pp. 1450003 ◽  
Author(s):  
Martin Kreuzer ◽  
Markus Kriegl
Keyword(s):  
Gröbner Basis ◽  
Gröbner Bases ◽  
Polynomial Ideal ◽  
Grobner Bases ◽  
Order Ideal ◽  
Grobner Basis ◽  
Syzygy Module ◽  
Syzygy Modules ◽  
Term Ordering ◽  
Algorithmic Form

Given an order ideal 𝒪 and an 𝒪-border basis of a 0-dimensional polynomial ideal, it was shown by Huibregtse that the liftings of the neighbor syzygies (i.e. of the fundamental syzygies of neighboring border terms) form a system of generators for the syzygy module of the border basis. We elaborate on Huibregtse's proof and transform it into explicit algorithmic form. Based on this, we are able to exhibit explicit conditions on a module term ordering τ such that the liftings of the neighbor syzygies are in fact a τ-Gröbner basis. Finally, we construct term orderings satisfying these conditions in an explicit algorithmic way.

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

Sign in / Sign up

Export Citation Format

Share Document