
Symbolic Rewriting Techniques
Springer (Publisher)
1st Edition
Published in March 1998
Book
Hardback
VII, 288 pages
978-3-7643-5901-0 (ISBN)
Description
Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, the Buchberger algorithm for Gröbner bases, the Ritt-Wu characteristic set method for ordinary differential equations, and the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.
More details
Series
Edition
1., 998
Language
English
Place of publication
Basel
Switzerland
Target group
College/higher education
Professional and scholarly
Research
Illustrations
VII, 288 p.
Illustrations
Dimensions
Height: 244 mm
Width: 170 mm
Weight
654 gr
ISBN-13
978-3-7643-5901-0 (9783764359010)
DOI
10.1007/978-3-0348-8800-4
Schweitzer Classification
Other editions
Additional editions

Manuel Bronstein | Johannes Grabmeier | Volker Weispfenning
Symbolic Rewriting Techniques
Book
10/2012
Birkhäuser
€53.49
Shipment within 10-15 days
Content
Parallel completion techniques, B. Amrhein et al; the computation of Grobner bases using an alternative algorithm, J. Apel; symmetrization based completion, R. Bundgen; on the reduction of G-invariant polynomials for an arbitrary permutation groups G, M. Gobel; the non-commutative Grobner freaks, E. Green et al; alternatives in implementing noncommutative grobner basis systems, B. Keller; a general approach to monoid and group rings, K. Madlener et al; Grobner fans and projective schemes, D. Mall; normalized rewriting - a unified view of Knut-Bendix completion and Grobner bases computation, C. Marche; new directions for syntactic termination orderings, U. Martin; two-sided Grobner bases in iterated ore extensions, M. Petho; computing the torsion group of elliptic curves by the method of Grobner bases, a. Petho et al; finding a finite group presentation using rewriting, P. Strogova; deciding degree-four-identities for alternative rings by rewriting, A. Widiger.