Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleSymbolic Rewriting Techniques [electronic resource] / edited by Manuel Bronstein, Volker Weispfenning, Johannes Grabmeier
ImprintBasel : Birkhรคuser Basel : Imprint: Birkhรคuser, 1998
Connect tohttp://dx.doi.org/10.1007/978-3-0348-8800-4
Descript VII, 288 p. online resource

SUMMARY

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: โ{128}ข the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, โ{128}ข the Buchberger algorithm for Grรถbner bases, โ{128}ข the Ritt-Wu characteristic set method for ordinary differential equations, and โ{128}ข 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


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 โ{128}{148} 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


Computer science Computers Mathematics Computer Science Theory of Computation Mathematics general



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram