𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Gröbner basis criterion for isomorphisms of algebraic varieties

✍ Scribed by Michał Kwieciński

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
494 KB
Volume
74
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fast Algorithm for Gröbner Basis Conve
A Fast Algorithm for Gröbner Basis Conversion and its Applications
✍ Quoc-Nam Tran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typicall

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

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

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu

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