Lifting canonical algorithms from a ring R to the ring R[x]
Methods of computation in polynomial rings are of central importance in computer algebra and have received a corresponding amount of attention. Among the problems of interest are (i) the choice of suitable bases for ideals, (ii) the choice of representatives of cosets and the reduction of a given polynomial to its equivalent representative, and (iii) the construction of a basis for the set of syzygies of a given ideal. The present paper addresses these problems by lifting from a ring R to R[x]. Let S be a set of polynomials generating an ideal J in R[x]. Let \(M_ k,...,M_ n\) be a partition of S such that for \(j=k,...,n\), the set \(M_ j\) consists of the polynomials of degree j; let \(LC_ j\) denote the set of leading coefficients of \(M_ j\). The sequence \(M_ k,...,M_ n\) is called a Szekeres sequence for J if for each i, \(LC_ i\) spans the ideal of leading coefficients of polynomials of degree i in J and k is the minimal degree of non-zero polynomials in J; it is a Szekeres basis if in addition the span of \(LC_{i-1}\) is properly contained in that of \(LC_ i\). The author gives an algorithm for constructing Szekeres bases and shows how such a basis may be used to lift canonical form algorithms from a ring R to R[x].
- Algebraic simplification
- Constructive Aspects of Noetherian Rings
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- scientific article; zbMATH DE number 3870585 (Why is no real title available?)
- scientific article; zbMATH DE number 3896290 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3614780 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Lifting canonical algorithms from a ring R to the ring R[x]
- On constructing bases for ideals in polynomial rings over the integers
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Lifting canonical algorithms from a ring R to the ring R[x]
- Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
- Some results on Gröbner bases over commutative rings
- An extension of the Prelle-Singer method and a Maple implementation
- [QPSI]. A MAPLE package for the determination of quasi-polynomial symmetries and invariants
- On an implementation of standard bases and syzygies in SINGULAR
- Finding elementary first integrals for rational second order ordinary differential equations
- H-bases and lifting problem for homogeneous ideals
- Integrating first-order differential equations with Liouvillian solutions via quadratures: a semi-algorithmic method
- Determining Liouvillian first integrals for dynamical systems in the plane
- A semi-algorithm to find elementary first order invariants of rational second order ordinary differential equations
This page was built for publication: Lifting canonical algorithms from a ring R to the ring R[x]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121016)
