Lindsay N. Childs – författare

This book is written as an introduction to higher algebra for students with a background of a year of calculus. It has been used as a successful undergraduate text for more than 20 years. The objective of the book is to give students enough experience in the algebraic theory of the integers and polynomials to appreciate the basic concepts of abstract algebra. New sections on Luhn's formula, Cosets and equations, and detaching coefficients are included. The later chapters include expositions of Rabiin's probabilistic primality test, quadratic reciprocity, and the classification of finite fields. Over 900 exercises, ranging from routine examples to extensions of theory, are found throughout the book; hints and answers for many of them are included in an appendix.

This book is written as an introduction to higher algebra for students with a background of a year of calculus. It has been used as a successful undergraduate text for more than 20 years. The objective of the book is to give students enough experience in the algebraic theory of the integers and polynomials to appreciate the basic concepts of abstract algebra. New sections on Luhn's formula, Cosets and equations, and detaching coefficients are included. The later chapters include expositions of Rabiin's probabilistic primality test, quadratic reciprocity, and the classification of finite fields. Over 900 exercises, ranging from routine examples to extensions of theory, are found throughout the book; hints and answers for many of them are included in an appendix.

This book is written as an introduction to higher algebra for students with a background of a year of calculus. It has been used as a successful undergraduate text for more than 20 years. The objective of the book is to give students enough experience in the algebraic theory of the integers and polynomials to appreciate the basic concepts of abstract algebra. New sections on Luhn's formula, Cosets and equations, and detaching coefficients are included. The later chapters include expositions of Rabiin's probabilistic primality test, quadratic reciprocity, and the classification of finite fields. Over 900 exercises, ranging from routine examples to extensions of theory, are found throughout the book; hints and answers for many of them are included in an appendix.

This book is written as an introduction to higher algebra for students with a background of a year of calculus. The first edition of this book emerged from a set of notes written in the 1970sfor a sophomore-junior level course at the University at Albany entitled "Classical Algebra." The objective of the course, and the book, is to give students enough experience in the algebraic theory of the integers and polynomials to appre­ ciate the basic concepts of abstract algebra. The main theoretical thread is to develop algebraic properties of the ring of integers: unique factorization into primes, congruences and congruence classes, Fermat''s theorem, the Chinese remainder theorem; and then again for the ring of polynomials. Doing so leads to the study of simple field extensions, and, in particular, to an exposition of finite fields. Elementary properties of rings, fields, groups, and homomorphisms of these objects are introduced and used as needed in the development. Concurrently with the theoretical development, the book presents a broad variety of applications, to cryptography, error-correcting codes, Latin squares, tournaments, techniques of integration, and especially to elemen­ tary and computational number theory. A student who asks, "Why am I learning this?," willfind answers usually within a chapter or two. For a first course in algebra, the book offers a couple of advantages. • By building the algebra out of numbers and polynomials, the book takes maximal advantage of the student''s prior experience in algebra and arithmetic. New concepts arise in a familiar context.

Hopf algebras have been shown to play a natural role in studying questions of integral module structure in extensions of local or global fields. This book surveys the state of the art in Hopf-Galois theory and Hopf-Galois module theory and can be viewed as a sequel to the first author's book, Taming Wild Extensions: Hopf Algebras and Local Galois Module Theory, which was published in 2000.The book is divided into two parts. Part I is more algebraic and focuses on Hopf-Galois structures on Galois field extensions, as well as the connection between this topic and the theory of skew braces. Part II is more number theoretical and studies the application of Hopf algebras to questions of integral module structure in extensions of local or global fields.Graduate students and researchers with a general background in graduate-level algebra, algebraic number theory, and some familiarity with Hopf algebras will appreciate the overview of the current state of this exciting area and the suggestions for numerous avenues for further research and investigation.

This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for  understanding these methods.  The objective is to provide a thorough understanding of RSA, Diffie–Hellman, and Blum–Goldwasser cryptosystems and Hamming and Reed–Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked.   To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra—rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets.  Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory.This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.

This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for  understanding these methods.  The objective is to provide a thorough understanding of RSA, Diffie–Hellman, and Blum–Goldwasser cryptosystems and Hamming and Reed–Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked.   To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra—rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets.  Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory.

This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.