Hans-Jurgen Schneider - Böcker

Hopf algebras have important connections to quantum theory, Lie algebras, knot and braid theory, operator algebras and other areas of physics and mathematics. They have been intensely studied in the past; in particular, the solution of a number of conjectures of Kaplansky from the 1970s has led to progress on the classification of semisimple Hopf algebras and on the structure of pointed Hopf algebras. Among the topics covered are results toward the classification of finite-dimensional Hopf algebras (semisimple and non-semisimple), as well as what is known about the extension theory of Hopf algebras. Some papers consider Hopf versions of classical topics, such as the Brauer group, while others are closer to work in quantum groups. The book also explores the connections and applications of Hopf algebras to other fields.

Hopf algebras have important connections to quantum theory, Lie algebras, knot and braid theory, operator algebras and other areas of physics and mathematics. They have been intensely studied in the past; in particular, the solution of a number of conjectures of Kaplansky from the 1970s has led to progress on the classification of semisimple Hopf algebras and on the structure of pointed Hopf algebras. Among the topics covered are results toward the classification of finite-dimensional Hopf algebras (semisimple and non-semisimple), as well as what is known about the extension theory of Hopf algebras. Some papers consider Hopf versions of classical topics, such as the Brauer group, while others are closer to work in quantum groups. The book also explores the connections and applications of Hopf algebras to other fields.

This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.