ALGEBRA AND DISCRETE MATHEMATICS – serie

It is eleven years since the First Edition of Geometry of Crystallographic Groups appeared. This Second Edition expands on the first, providing details of a new result of automorphism of crystallographic groups, and on Hantzsche-Wendt groups/manifolds.Crystalographic groups are groups which act via isometries on some n-dimensional Euclidean space, so-named because in three dimensions they occur as the symmetry groups of a crystal. There are short introductions to the theme before every chapter, and a list of conjectures and open projects at the end of the book.Geometry of Crystallographic Groups is suitable as a textbook for students, containing basic theory of crystallographic groups. It is also suitable for researchers in the field, discussing in its second half more advanced and recent topics.

This book is a festschrift in honor of Professor Anthony Gaglione's sixtieth birthday. This volume presents an excellent mix of research and expository articles on various aspects of infinite group theory. The papers give a broad overview of present research in infinite group theory in general, and combinatorial group theory and non-Abelian group-based cryptography in particular. They also pinpoint the interactions between combinatorial group theory and mathematical logic, especially model theory.

Buildings are combinatorial constructions successfully exploited to study groups of various types. The vertex set of a building can be naturally decomposed into subsets called Grassmannians. The book contains both classical and more recent results on Grassmannians of buildings of classical types. It gives a modern interpretation of some classical results from the geometry of linear groups. The presented methods are applied to some geometric constructions non-related to buildings — Grassmannians of infinite-dimensional vector spaces and the sets of conjugate linear involutions.The book is self-contained and the requirement for the reader is a knowledge of basic algebra and graph theory. This makes it very suitable for use in a course for graduate students.

This textbook presents fundamental topics in discrete mathematics introduced from the perspectives of a pure mathematician and an applied computer scientist. The synergy between the two complementary perspectives is seen throughout the book; key concepts are motivated and explained through real-world examples, and yet are still formalized with mathematical rigor. The book is an excellent introduction to discrete mathematics for computer science, software engineering, and mathematics students.The first author is a leading mathematician in the area of logic, computability, and theoretical computer science, with more than 25 years of teaching and research experience. The second author is a computer science PhD student at the University of Washington specializing in database systems. The father-and-daughter team merges two different views to create a unified book for students interested in learning discrete mathematics, the connections between discrete mathematics and computer science, and the mathematical foundations of computer science.Readers will learn how to formally define abstract concepts, reason about objects (such as programs, graphs and numbers), investigate properties of algorithms, and prove their correctness. The textbook studies several well-known algorithmic problems including the path problem for graphs and finding the greatest common divisor, inductive definitions, proofs of correctness of algorithms via loop invariants and induction, the basics of formal methods such as propositional logic, finite state machines, counting, probability, as well as the foundations of databases such as relational calculus.