Special Issue on Applications of Gröbner Bases: Foreword of the Guest Editors
✍ Scribed by Quoc-Nam Tran; Franz Winkler
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 70 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Algorithms for eliminating variables from systems of multivariate polynomials are essential tools in constructive algebra and algebraic geometry. The reason is that a number of important computational problems in these areas can be tackled by elimination techniques. In particular, elimination method
Let R be a Noetherian commutative ring with identity, K a field and π a ring homomorphism from R to K. We investigate for which ideals in R[x 1 , . . . , xn] and admissible orders the formation of leading monomial ideals commutes with the homomorphism π.
Equational logic is ubiquitous in computer science. It is the basis for algebraic specification, rewriting, unification, and equational programming. These techniques evolved in a many-sorted setting, where different sorts are disjoint. Joseph Goguen observed that an order-sorted equational logic mod
Galois theory is a standard topic in every algebra course. Computational and constructive methods in Galois theory have not yet attained this status. Algorithms to compute Galois groups go back as far as the nineteenth century and are described in the classical monograph of Tschebotaröw and Schwerd