This proceedings volume documents the contributions presented at the conference held at Fairfield University and at the Graduate Center, CUNY in 2018 celebrating the New York Group Theory Seminar, in memoriam Gilbert Baumslag, and to honor Benjamin Fine and Anthony Gaglione. It includes several expert contributions by leading figures in the group theory community and provides a valuable source of information on recent research developments.

The fundamental theorem of algebra states that any complex polynomial must have a complex root. This book examines three pairs of proofs of the theorem from three different areas of mathematics: abstract algebra, complex analysis and topology. The first proof in each pair is fairly straightforward and depends only on what could be considered elementary mathematics. However, each of these first proofs leads to more general results from which the fundamental theorem can be deduced as a direct consequence. These general results constitute the second proof in each pair. To arrive at each of the proofs, enough of the general theory of each relevant area is developed to understand the proof. In addition to the proofs and techniques themselves, many applications such as the insolvability of the quintic and the transcendence of e and pi are presented. Finally, a series of appendices give six additional proofs including a version of Gauss'original first proof. The book is intended for junior/senior level undergraduate mathematics students or first year graduate students, and would make an ideal "capstone" course in mathematics.

After being an open question for sixty years the Tarski conjecture was answered in the affirmative by Olga Kharlampovich and Alexei Myasnikov and independently by Zlil Sela. Both proofs involve long and complicated applications of algebraic geometry over free groups as well as an extension of methods to solve equations in free groups originally developed by Razborov. This book is an examination of the material on the general elementary theory of groups that is necessary to begin to understand the proofs. This material includes a complete exposition of the theory of fully residually free groups or limit groups as well a complete description of the algebraic geometry of free groups. Also included are introductory material on combinatorial and geometric group theory and first-order logic. There is then a short outline of the proof of the Tarski conjectures in the manner of Kharlampovich and Myasnikov.

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents: Algebraic structures Cryptography Number theoretic algorithms Polynomial time primality test Elliptic curves Combinatorics on words Automata Discrete infinite groups

The fundamental theorem of algebra states that any complex polynomial must have a complex root. This book examines three pairs of proofs of the theorem from three different areas of mathematics: abstract algebra, complex analysis and topology. The first proof in each pair is fairly straightforward and depends only on what could be considered elementary mathematics. However, each of these first proofs leads to more general results from which the fundamental theorem can be deduced as a direct consequence. These general results constitute the second proof in each pair. To arrive at each of the proofs, enough of the general theory of each relevant area is developed to understand the proof. In addition to the proofs and techniques themselves, many applications such as the insolvability of the quintic and the transcendence of e and pi are presented. Finally, a series of appendices give six additional proofs including a version of Gauss'original first proof. The book is intended for junior/senior level undergraduate mathematics students or first year graduate students, and would make an ideal "capstone" course in mathematics.

This second edition gives a thorough introduction to the vast field of Abstract Algebra with a focus on its rich applications. It is among the pioneers of a new approach to conveying abstract algebra starting with rings and fields, rather than with groups. Our teaching experience shows that examples of groups seem rather abstract and require a certain formal framework and mathematical maturity that would distract a course from its main objectives. Our philosophy is that the integers provide the most natural example of an algebraic structure that students know from school. A student who goes through ring theory first, will attain a solid background in Abstract Algebra and be able to move on to more advanced topics. The centerpiece of our book is the development of Galois Theory and its important applications, such as the solvability by radicals and the insolvability of the quintic, the fundamental theorem of algebra, the construction of regular n-gons and the famous impossibilities: squaring the circling, doubling the cube and trisecting an angle. However, our book is not limited to the foundations of abstract algebra but concludes with chapters on applications in Algebraic Geometry and Algebraic Cryptography.

In the two-volume set 'A Selection of Highlights' we present basics of mathematics in an exciting and pedagogically sound way. This volume examines many fundamental results in Geometry and Discrete Mathematics along with their proofs and their history. In the second edition we include a new chapter on Topological Data Analysis and enhanced the chapter on Graph Theory for solving further classical problems such as the Traveling Salesman Problem.

Now in its second edition, this textbook provides an introduction and overview of number theory based on the density and properties of the prime numbers. This unique approach offers both a firm background in the standard material of number theory, as well as an overview of the entire discipline. All of the essential topics are covered, such as the fundamental theorem of arithmetic, theory of congruences, quadratic reciprocity, arithmetic functions, and the distribution of primes. New in this edition are coverage of p-adic numbers, Hensel's lemma, multiple zeta-values, and elliptic curve methods in primality testing. Key topics and features include: A solid introduction to analytic number theory, including full proofs of Dirichlet's Theorem and the Prime Number Theorem Concise treatment of algebraic number theory, including a complete presentation of primes, prime factorizations in algebraic number fields, and unique factorization of ideals Discussion of the AKS algorithm, which shows that primality testing is one of polynomial time, a topic not usually included in such texts Many interesting ancillary topics, such as primality testing and cryptography, Fermat and Mersenne numbers, and Carmichael numbers The user-friendly style, historical context, and wide range of exercises that range from simple to quite difficult (with solutions and hints provided for select exercises) make Number Theory: An Introduction via the Density of Primes ideal for both self-study and classroom use. Intended for upper level undergraduates and beginning graduates, the only prerequisites are a basic knowledge of calculus, multivariable calculus, and some linear algebra. All necessary concepts from abstract algebra and complex analysis are introduced where needed.

Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptography. It grew out of many courses presented by the authors over the past twenty years at various universities and covers a wide range of topics in mathematical cryptography. It is primarily geared towards graduate students and advanced undergraduates in mathematics and computer science, but may also be of interest to researchers in the area. Besides the classical methods of symmetric and private key encryption, the book treats the mathematics of cryptographic protocols and several unique topics such as Group-Based Cryptography Groebner Basis Methods in Cryptography Lattice-Based Cryptography

Now in its second edition, this textbook provides an introduction and overview of number theory based on the density and properties of the prime numbers. This unique approach offers both a firm background in the standard material of number theory, as well as an overview of the entire discipline. All of the essential topics are covered, such as the fundamental theorem of arithmetic, theory of congruences, quadratic reciprocity, arithmetic functions, and the distribution of primes. New in this edition are coverage of p-adic numbers, Hensel's lemma, multiple zeta-values, and elliptic curve methods in primality testing. Key topics and features include: A solid introduction to analytic number theory, including full proofs of Dirichlet's Theorem and the Prime Number Theorem Concise treatment of algebraic number theory, including a complete presentation of primes, prime factorizations in algebraic number fields, and unique factorization of ideals Discussion of the AKS algorithm, which shows that primality testing is one of polynomial time, a topic not usually included in such texts Many interesting ancillary topics, such as primality testing and cryptography, Fermat and Mersenne numbers, and Carmichael numbers The user-friendly style, historical context, and wide range of exercises that range from simple to quite difficult (with solutions and hints provided for select exercises) make Number Theory: An Introduction via the Density of Primes ideal for both self-study and classroom use. Intended for upper level undergraduates and beginning graduates, the only prerequisites are a basic knowledge of calculus, multivariable calculus, and some linear algebra. All necessary concepts from abstract algebra and complex analysis are introduced where needed.

The fundamental aim of this book is to communicate the knowledge necessary for a competent mathematical assessment of modern developments in the age of the Internet. Most crucially, this includes an understanding of very large graphs, calculating with large numbers, and calculating using prime number bases.

Dieses Buch basiert auf der Vorlesung algebraische Strukturen fur Informatiker der Universitat Dortmund, dieseit vielen Jahren erfolgreich gehalten wird.Leitfaden ist die Vermittlungder notwendigen Kenntnisse fur eine kompetent mathematische Beurteilung der modernen Entwicklungen im Internetzeitalter.Unter Anderemwird das elementare Rechnen mit elliptischen Kurven eingefuhrt, mit dem die Standardanwendungen in der Kryptographie erklart werden konnen. Fur alle wichtigen Aussagen sind vollstandige Beweise angegeben. Dabei ist das benotigte Vorwissen gering. Statt einerAuflistung von stur zu befolgenden Kochrezepten vermittelt das Buch ein tieferes Verstandnis fur die behandelten mathematischen Zusammenhange.DerLeser kann mit dem dargestelltenWissen, Techniken und Denkweisenselbststandig mathematische Probleme losen. Die Autoren zeigen, dass es sich bei der diskreten Mathematik um ein modernes und spannendes Gebiet mit vielen Anwendungen handelt. Die Lekture dieses Buchesbringt Spass."