We develop a theory of Gröbner bases over Galois rings, following the usual formulation for Gröbner bases over finite fields. Our treatment includes a division algorithm, a characterization of Gröbner bases, and an extension of Buchberger's algorithm. One application is towards the problem of decodi
A combinatorial result on Gröbner Fans with an application to universal Gröbner bases
✍ Scribed by Stéphane Collait; Daniel Mall
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 608 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Standard noncommutative Grobner basis procedures are used for computing ïdeals of free noncommutative polynomial rings over fields. This paper describes Grobner basis procedures for one-sided ideals in finitely presented noncommuta-ẗive algebras over fields. The polynomials defining a K-algebra A as
The cfassicd method of Grijbner bases for multivariate polynomials in computer alge bra and the related Buchberger's algorithm and its modifications for the computation of such bases are applied to some elementary problems of kinematics as well as to the classical Kepler-Newton problem in celestial
The Gröbner bases of the ideal generated by the symmetric functions are presented. Moreover we show how they can be fruitfully applied to a problem arising from coding theory.
We present an algorithm to decide whether a homogeneous linear partial difference equation with constant coefficients provides an unfalsified model for a finite set of observations, which consist in multiindexed signals, known on a finite subset of N n . To this aim we introduce the concept of "gene