Some Tapas of Computer Algebra

Cohen, Arjeh M. (Editor); Cuyper, Hans (Editor); Sterk, Hans (Editor)

ISBN 10: 3540634800 / ISBN 13: 9783540634805

Edité par Springer-Verlag, 1999

A propos de cet article

Fine/None (8497) New in unopened publisher shrinkwrap. No remainder mark. . 352.

N° de réf. du vendeur 8497

Détails bibliographiques

• Titre: Some Tapas of Computer Algebra
• Éditeur: Springer-Verlag
• Date de parution: 1999
• Langue: anglais
• ISBN à 10 chiffres: 3540634800
• ISBN à 13 chiffres: 9783540634805
• Reliure: Hardcover
• Édition: First edition.

A propos de ce titre

Synopsis

In the years 1994, 1995, two EIDMA mini courses on Computer Algebra were given at the Eindhoven University of Technology by, apart from ourselves, various invited lecturers. (EIDMA is the Research School 'Euler Institute for Discrete Mathematics and its Applications'.) The idea of the courses was to acquaint young mathematicians with algorithms and software for mathemat- ical research and to enable them to incorporate algorithms in their research. A collection of lecture notes was used at these courses. When discussing these courses in comparison with other kinds of courses one might give in a week's time, Joachim Neubüser referred to our courses as 'tapas'. This denomination underlined that the courses consisted of appe- tizers for various parts of algorithmic algebra; indeed, we covered such spicy topics as the link between Gröbner bases and integer programming, and the detection of algebraic solutions to differential equations. As a collection, the not es turned out to have some appeal of their own, which is the main reason why the idea came up of transforming them into book form. We feIt however, that the book should be distinguishable from a standard text book on computer algebra in that it retains its appetizing flavour by presenting a variety of topics at an accessible level with a view to recent developments.

Présentation de l'éditeur

This book presents the basic concepts and algorithms of computer algebra using practical examples that illustrate their actual use in symbolic computation. A wide range of topics are presented, including: Groebner bases, real algebraic geometry, lie algebras, factorization of polynomials, integer programming, permutation groups, differential equations, coding theory, automatic theorem proving, and polyhedral geometry. This book is a must read for anyone working in the area of computer algebra, symbolic computation, and computer science.