SOME TAPAS OF COMPUTER ALGEBRA (HB). Dieser Artikel ist nicht verfügbar.SOME TAPAS OF COMPUTER ALGEBRA (HB)

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.

This book arose from a series of courses on computer algebra which were given at Eindhoven Technical University. Its chapters present a variety of topics in computer algebra at an accessible (upper undergraduate/graduate) level with a view towards recent developments. For those wanting to acquaint themselves somewhat further with the material, the book also contains seven 'projects', which could serve as practical sessions related to one or more chapters.
The contributions focus on topics like Gröbner bases, real algebraic geometry, Lie algebras, factorisation of polynomials, integer programming, permutation groups, differential equations, coding theory, automatic theorem proving, and polyhedral geometry.
This book is a must-read for everybody interested in computer algebra.