Murray R. Bremner - Böcker

Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Gröbner bases in several contexts. The book builds up to the theory of Gröbner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. The authors present a variety of topics including: noncommutative Gröbner bases and their applications to the construction of universal enveloping algebras; Gröbner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and operadic Gröbner bases, important for applications to algebraic topology, and homological and homotopical algebra. The last chapters of the book combine classical commutative Gröbner bases with operadic ones to approach some classification problems for operads. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and exercises are provided to clarify and illustrate the concrete meaning of abstract theory.

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial factorization, and matrix canonical forms.

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial factorization, and matrix canonical forms.

Nonassociative mathematics is a broad research area that studies mathematical structures violating the associative law $x(yz)=(xy)z$. The topics covered by nonassociative mathematics include quasigroups, loops, Latin squares, Lie algebras, Jordan algebras, octonions, racks, quandles, and their applications.This volume contains the proceedings of the Fourth Mile High Conference on Nonassociative Mathematics, held from July 29-August 5, 2017, at the University of Denver, Denver, Colorado. Included are research papers covering active areas of investigation, survey papers covering Leibniz algebras, self-distributive structures, and rack homology, and a sampling of applications ranging from Yang-Mills theory to the Yang-Baxter equation and Laver tables.An important aspect of nonassociative mathematics is the wide range of methods employed, from purely algebraic to geometric, topological, and computational, including automated deduction, all of which play an important role in this book.