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.

The first interactive course covering first and second year algebra. Starting from such fundamental topics as integers and divisions, modular arithmetic and polynomials the content extends to rings, fields and permutation groups. The hypertext is written in Java-enhanced HTML, and Java applets illustrate the theory while also contributing interactive calculators for computing with integers, polynomials and permutations. The computer algebra system GAP is integrated throughout, allowing the calculation and manipulation of mathematical objects. In addition, collections for Mathematica notebooks and Maple worksheets review the algorithms presented. Multiple choice exercises provide users with instant feedback, while facilities for monitoring students and a bulletin board complete this digital course.

This book provides a self-contained introduction to diagram geometry. Tight connections with group theory are shown. It treats thin geometries (related to Coxeter groups) and thick buildings from a diagrammatic perspective. Projective and affine geometry are main examples. Polar geometry is motivated by polarities on diagram geometries and the complete classification of those polar geometries whose projective planes are Desarguesian is given. It differs from Tits' comprehensive treatment in that it uses Veldkamp's embeddings.

The book intends to be a basic reference for those who study diagram geometry. Group theorists will find examples of the use of diagram geometry. Light on matroid theory is shed from the point of view of geometry with linear diagrams. Those interested in Coxeter groups and those interested in buildings will find brief but self-contained introductions into these topics from the diagrammatic perspective. Graph theorists will find many highly regular graphs.

The text is written so graduate students will be able to follow the arguments without needing recourse to further literature.

A strong point of the book is the density of examples.

This book provides a self-contained introduction to diagram geometry. Tight connections with group theory are shown. It treats thin geometries (related to Coxeter groups) and thick buildings from a diagrammatic perspective. Projective and affine geometry are main examples. Polar geometry is motivated by polarities on diagram geometries and the complete classification of those polar geometries whose projective planes are Desarguesian is given. It differs from Tits' comprehensive treatment in that it uses Veldkamp's embeddings. The book intends to be a basic reference for those who study diagram geometry. Group theorists will find examples of the use of diagram geometry. Light on matroid theory is shed from the point of view of geometry with linear diagrams. Those interested in Coxeter groups and those interested in buildings will find brief but self-contained introductions into these topics from the diagrammatic perspective. Graph theorists will find many highly regular graphs. The text is written so graduate students will be able to follow the arguments without needing recourse to further literature. A strong point of the book is the density of examples.

Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. This interplay between regularity and symmetry properties of graphs is the theme of this book. Starting from very elementary regularity properties, the concept of a distance-regular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. Several other important regular combinatorial structures are then shown to be equivalent to special families of distance-regular graphs. Other subjects of more general interest, such as regularity and extremal properties in graphs, association schemes, representations of graphs in euclidean space, groups and geometries of Lie type, groups acting on graphs, and codes are covered independently. Many new results and proofs and more than 750 references increase the encyclopaedic value of this book.

From 1-4 April 1986 a Symposium on Algebraic Groups was held at the University of Utrecht, The Netherlands, in celebration of the 350th birthday of the University and the 60th of T.A. Springer. Recognized leaders in the field of algebraic groups and related areas gave lectures which covered wide and central areas of mathematics. Though the fourteen papers in this volume are mostly original research contributions, some survey articles are included. Centering on the Symposium subject, such diverse topics are covered as Discrete Subgroups of Lie Groups, Invariant Theory, D-modules, Lie Algebras, Special Functions, Group Actions on Varieties.

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.