This text provides a thorough introduction to “modern” or “abstract” algebra at a level suitable for upper-level undergraduates and beginning graduate students. The book addresses the conventional topics: groups, rings, fields, and linear algebra, with symmetry as a unifying theme. This subject matter is central and ubiquitous in modern mathematics and in applications ranging from quantum physics to digital communications. The most important goal of this book is to engage students in the ac- tive practice of mathematics.

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields. We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm. The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

Brief, clear, and well written, this introductory treatment bridges the gap between traditional and modern algebra. Includes exercises with complete solutions. The only prerequisite is high school-level algebra. 1959 edition.

This text is formulated on the fundamental idea that much of mathematics, including the classical number systems, can best be based on set theory. Beginning with a discussion of the rudiments of set theory, authors Norman T. Hamilton and Joseph Landin lead readers through a construction of the natural number system, discussing the integers and the rational numbers, and concluding with an in-depth examination of the real numbers. Drawn from lecture notes for a course intended primarily for high school mathematics teachers, this volume was designed to answer the question, "What is a number?" and to provide a foundation for the study of abstract algebra, elementary Euclidean geometry, and analysis. Upon completion of this treatment — which is suitable for high school mathematics teachers and advanced high school students — readers should be well prepared for introductory courses in abstract algebra and real variables.

This presentation on the basics of Boolean algebra has ranked among the fundamental books on this important subject in mathematics and computing science since its initial publication in 1963. Concise and informal as well as systematic, the text draws upon lectures delivered by Professor Halmos at the University of Chicago to cover many topics in brief individual chapters. The approach is suitable for advanced undergraduates and graduate students in mathematics. Starting with Boolean rings and algebras, the treatment examines fields of sets, regular open sets, elementary relations, infinite operations, subalgebras, homomorphisms, free algebras, ideals and filters, and the homomorphism theorem. Additional topics include measure algebras, Boolean spaces, the representation theorem, duality for ideals and for homomorphisms, Boolean measure spaces, isomorphisms of factors, projective and injective algebras, and many other subjects. Several chapters conclude with stimulating exercises; the solutions are not included.

This book provides the basic theory, techniques, and algorithms of modern cryptography that are applicable to network and cyberspace security. It consists of the following nine main chapters: Chapter 1 provides the basic concepts and ideas of cyberspace and cyberspace security, Chapters 2 and 3 provide an introduction to mathematical and computational preliminaries, respectively. Chapters 4 discusses the basic ideas and system of secret-key cryptography, whereas Chapters 5, 6, and 7 discuss the basic ideas and systems of public-key cryptography based on integer factorization, discrete logarithms, and elliptic curves, respectively. Quantum-safe cryptography is presented in Chapter 8 and offensive cryptography, particularly cryptovirology, is covered in Chapter 9. This book can be used as a secondary text for final-year undergraduate students and first-year postgraduate students for courses in Computer, Network, and Cyberspace Security. Researchers and practitioners working in cyberspace security and network security will also find this book useful as a reference.

A Concrete Approach to Abstract Algebra presents a solid and highly accessible introduction to abstract algebra by providing details on the building blocks of abstract algebra.It begins with a concrete and thorough examination of familiar objects such as integers, rational numbers, real numbers, complex numbers, complex conjugation, and polynomials. The author then builds upon these familiar objects and uses them to introduce and motivate advanced concepts in algebra in a manner that is easier to understand for most students. Exercises provide a balanced blend of difficulty levels, while the quantity allows the instructor a latitude of choices. The final four chapters present the more theoretical material needed for graduate study.This text will be of particular interest to teachers and future teachers as it links abstract algebra to many topics which arise in courses in algebra, geometry, trigonometry, precalculus, and calculus. Presents a more natural 'rings first' approach to effectively leading the student into the the abstract material of the course by the use of motivating concepts from previous math courses to guide the discussion of abstract algebra Bridges the gap for students by showing how most of the concepts within an abstract algebra course are actually tools used to solve difficult, but well-known problems Builds on relatively familiar material (Integers, polynomials) and moves onto more abstract topics, while providing a historical approach of introducing groups first as automorphisms Exercises provide a balanced blend of difficulty levels, while the quantity allows the instructor a latitude of choices

This unified treatment of linear and nonlinear filtering theory presents material previously available only in journals, and in terms accessible to engineering students. Its sole prerequisites are advanced calculus, the theory of ordinary differential equations, and matrix analysis. Although theory is emphasized, the text discusses numerous practical applications as well. Taking the state-space approach to filtering, this text models dynamical systems by finite-dimensional Markov processes, outputs of stochastic difference, and differential equations. Starting with background material on probability theory and stochastic processes, the author introduces and defines the problems of filtering, prediction, and smoothing. He presents the mathematical solutions to nonlinear filtering problems, and he specializes the nonlinear theory to linear problems. The final chapters deal with applications, addressing the development of approximate nonlinear filters, and presenting a critical analysis of their performance.

Concise, unified, and logical introduction to study of the basic principles of fluid dynamics emphasizes statement of problems in mathematical language. Assumes familiarity with algebra of vector fields. 1963 edition.

Clear, elementary explanation of basic forms, Renaissance to 1900, with many works analyzed. Nature and function of concerto, sonata, etc., clarified with nonmusical analogies; illustrated in detailed analysis of specific piece of music.