Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Groebner bases in several contexts. The book builds up to the theory of Groebner 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 Groebner bases and their applications to the construction of universal enveloping algebras; Groebner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and operadic Groebner bases, important for applications to algebraic topology, and homological and homotopical algebra. The last chapters of the book combine classical commutative Groebner 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.