𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universal and comprehensive Gröbner bases of the classical determinantal ideal

✍ Scribed by M. Kalinin

Publisher
Springer US
Year
2010
Tongue
English
Weight
597 KB
Volume
168
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new notion of reduction: Generating un
A new notion of reduction: Generating universal Gröbner bases of ideals in K[x, y]
✍ W. Herfort; H. Penz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 996 KB

In this paper a new notion of reduction depending on an arbitrary non-empty set ORD of term orderings on a polynomial ring is introduced. A general Buchberger algorithm based on this notion is devised. For a single element set ORD it specializes to the ordinary Buehberger algorithm. For ORD being th

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