
Symbolic Rewriting Techniques
Birkhäuser (Publisher)
Published on 23. October 2012
Book
Paperback/Softback
VII, 288 pages
978-3-0348-9779-2 (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.
Reviews / Votes
"14 contributions can be found within 288 pages, each of them with an extended reference list... Of high value to people who have some experience in this subject matter."
--The DERIVE Newsletter
More details
Series
Edition
Softcover reprint of the original 1st ed. 1998
Language
English
Place of publication
Basel
Switzerland
Publishing group
Springer Basel
Target group
Professional and scholarly
Research
Illustrations
VII, 288 p.
Dimensions
Height: 244 mm
Width: 170 mm
Thickness: 17 mm
Weight
522 gr
ISBN-13
978-3-0348-9779-2 (9783034897792)
DOI
10.1007/978-3-0348-8800-4
Schweitzer Classification
Other editions
Additional editions

Manuel Bronstein | Johannes Grabmeier | Volker Weispfenning
Symbolic Rewriting Techniques
Book
03/1998
1st Edition
Springer
€85.55
Article exhausted; check different version
Content
Parallel Completion Techniques.- The Computation of Gröbner Bases Using an Alternative Algorithm.- Symmetrization Based Completion.- On the Reduction of G-invariant Polynomials for an Arbitrary Permutation Groups G.- The Non-Commutaive Gröbner Freaks.- Alternatives in Implementing Noncommutative Gröbner Basis Systems.- String Rewriting and Gröbner Bases - A General Approach to Monoid and Group Rings.- Gröbner Fans and Projective Schemes.- Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Gröbner Bases Computation.- New Directions for Syntactic Termination Orderings.- Two-sided Gröbner Bases in Iterated Ore Extensions.- Computing the Torsion Group of Elliptic Curves by the Method of Gröbner Bases.- Finding a Finite Group presentation Using Rewriting.- Deciding Degree-Four-Identities for Alternative Rings by Rewriting.