Abstract Algebra with Applications provides a friendly and concise introduction to algebra, with an emphasis on its uses in the modern world. The first part of this book covers groups, after some preliminaries on sets, functions, relations, and induction, and features applications such as public-key cryptography, Sudoku, the finite Fourier transform, and symmetry in chemistry and physics. The second part of this book covers rings and fields, and features applications such as random number generators, error correcting codes, the Google page rank algorithm, communication networks, and elliptic curve cryptography. The book's masterful use of colorful figures and images helps illustrate the applications and concepts in the text. Real-world examples and exercises will help students contextualize the information. Intended for a year-long undergraduate course in algebra for mathematics, engineering, and computer science majors, the only prerequisites are calculus and a bit of courage when ask
This book gives a friendly introduction to Fourier analysis on finite groups, both commutative and non-commutative. Aimed at students in mathematics, engineering and the physical sciences, it examines the theory of finite groups in a manner that is both accessible to the beginner and suitable for graduate research. With applications in chemistry, error-correcting codes, data analysis, graph theory, number theory and probability, the book presents a concrete approach to abstract group theory through applied examples, pictures and computer experiments. In the first part, the author parallels the development of Fourier analysis on the real line and the circle, and then moves on to analogues of higher dimensional Euclidean space. The second part emphasizes matrix groups such as the Heisenberg group of upper triangular 2x2 matrices. The book concludes with an introduction to zeta functions on finite graphs via the trace formula.
This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations. It is intended for be
Graph theory meets number theory in this stimulating book. Ihara zeta functions of finite graphs are reciprocals of polynomials, sometimes in several variables. Analogies abound with number-theoretic functions such as Riemann/Dedekind zeta functions. For example, there is a Riemann hypothesis (which may be false) and prime number theorem for graphs. Explicit constructions of graph coverings use Galois theory to generalize Cayley and Schreier graphs. Then non-isomorphic simple graphs with the same zeta are produced, showing you cannot hear the shape of a graph. The spectra of matrices such as the adjacency and edge adjacency matrices of a graph are essential to the plot of this book, which makes connections with quantum chaos and random matrix theory, plus expander/Ramanujan graphs of interest in computer science. Created for beginning graduate students, the book will also appeal to researchers. Many well-chosen illustrations and exercises, both theoretical and computer-based, are inclu
