𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Generalization of Gröbner Basis Algorithms to Nilpotent Group Rings

✍ Scribed by K. Madlener; B. Reinert

Book ID
105867632
Publisher
Springer
Year
1997
Tongue
English
Weight
402 KB
Volume
8
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Generalization of Gröbner Basis Algori
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings
✍ Klaus Madlener; Birgit Reinert 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 656 KB

It is well-known that for the integral group ring of a polycyclic group several decision problems are decidable, in particular the ideal membership problem. In this paper we define an effective reduction relation for group rings over polycyclic groups. This reduction is based on left multiplication

A Gröbner Basis Method for Modules over
A Gröbner Basis Method for Modules over Rings of Differential Operators
✍ Toshinori Oaku; Takeshi Shimoyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 683 KB

We study modules over the ring \(\mathcal{D}_{0}\) of differential operators with power series coeffcients. For \(\mathcal{D}_{0}\)-modules, we introduce a new notion of \(F\)-Gröbner basis and present an algorithmic method to compute it. Our method is more algebraic than that of Castro \((1986,1987

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper