The book begins by tracing the development of cryptology from that of an arcane practice used, for example, to conceal alchemic recipes, to the modern scientific method that is studied and employed today. The remainder of the book explores the modern aspects and applications of cryptography, covering symmetric- and public-key cryptography, cryptographic protocols, key management, message authentication, e-mail and Internet security, and advanced applications such as wireless security, smart cards, biometrics, and quantum cryptography. The author also includes non-cryptographic security issues and a chapter devoted to information theory and coding. Nearly 200 diagrams, examples, figures, and tables along with abundant references and exercises complement the discussion.
Written by leading authority and best-selling author on the subject Richard A. Mollin, Codes: The Guide to Secrecy from Ancient to Modern Times is the essential reference for anyone interested in this exciting and fascinating field, from novice to veteran practitioner.
The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine.
What else is new?
New chapters on measurement and analytic graph theory
Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing.
Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth
Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition
Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
New to the Second Edition
Reorganization of all chapters More complete and involved treatment of Galois theory A study of binary quadratic forms and a comparison of the ideal and form class groups More comprehensive section on Pollard’s cubic factoring algorithm More detailed explanations of proofs, with less reliance on exercises, to provide a sound understanding of challenging material
The book includes mini-biographies of notable mathematicians, convenient cross-referencing, a comprehensive index, and numerous exercises. The appendices present an overview of all the concepts used in the main text, an overview of sequences and series, the Greek alphabet with English transliteration, and a table of Latin phrases and their English equivalents.
Suitable for a one-semester course, this accessible, self-contained text offers broad, in-depth coverage of numerous applications. Readers are lead at a measured pace through the topics to enable a clear understanding of the pinnacles of algebraic number theory.
With numerous examples throughout, the text begins with coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density, and primes in arithmetic progression. It then applies these tools to Diophantine equations, before developing elliptic curves and modular forms. The text also presents an overview of Fermat’s Last Theorem (FLT) and numerous consequences of the ABC conjecture, including Thue–Siegel–Roth theorem, Hall’s conjecture, the Erdös–Mollin-–Walsh conjecture, and the Granville–Langevin Conjecture. In the appendix, the author reviews sieve methods, such as Eratothesenes’, Selberg’s, Linnik’s, and Bombieri’s sieves. He also discusses recent results on gaps between primes and the use of sieves in factoring.
By focusing on salient techniques in number theory, this textbook provides the most up-to-date and comprehensive material for a second course in this field. It prepares students for future study at the graduate level.
This edition now offers a thorough development of the embedding of Latin squares and combinatorial designs. It also presents some pure mathematical ideas, including connections between universal algebra and graph designs.
The authors focus on several basic designs, including Steiner triple systems, Latin squares, and finite projective and affine planes. They produce these designs using flexible constructions and then add interesting properties that may be required, such as resolvability, embeddings, and orthogonality. The authors also construct more complicated structures, such as Steiner quadruple systems.
By providing both classical and state-of-the-art construction techniques, this book enables students to produce many other types of designs.
Discrete Structures and Their Interactions highlights the connections among various discrete structures, including graphs, directed graphs, hypergraphs, partial orders, finite topologies, and simplicial complexes. It also explores their relationships to classical areas of mathematics, such as linear and multilinear algebra, analysis, probability, logic, and topology.
The text introduces a number of discrete structures, such as hypergraphs, finite topologies, preorders, simplicial complexes, and order ideals of monomials, that most graduate students in combinatorics, and even some researchers in the field, seldom experience. The author explains how these structures have important applications in many areas inside and outside of combinatorics. He also discusses how to recognize valuable research connections through the structures.
Intended for graduate and upper-level undergraduate students in mathematics who have taken an initial course in discrete mathematics or graph theory, this book shows how discrete structures offer new insights into the classical fields of mathematics. It illustrates how to use discrete structures to represent the salient features and discover the underlying combinatorial principles of seemingly unrelated areas of mathematics.
New to the Second Edition Chapters on isogenies and hyperelliptic curves A discussion of alternative coordinate systems, such as projective, Jacobian, and Edwards coordinates, along with related computational issues A more complete treatment of the Weil and Tate–Lichtenbaum pairings Doud’s analytic method for computing torsion on elliptic curves over Q An explanation of how to perform calculations with elliptic curves in several popular computer algebra systems
Taking a basic approach to elliptic curves, this accessible book prepares readers to tackle more advanced problems in the field. It introduces elliptic curves over finite fields early in the text, before moving on to interesting applications, such as cryptography, factoring, and primality testing. The book also discusses the use of elliptic curves in Fermat’s Last Theorem. Relevant abstract algebra material on group theory and fields can be found in the appendices.
The book presents several existing, yet still interesting and instructive, examples of modular forms. Two chapters develop useful properties of the Bernoulli numbers and illustrate arithmetic progressions, proving the theorems of van der Waerden, Roth, and Szemeredi. The book also explains applications of the theory to three problems that lie outside of number theory in the areas of cryptanalysis, microwave radiation, and diamond cutting. The text is complemented by the inclusion of over one hundred exercises to test the reader's understanding.
Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications.
Highlights of the Second Edition:
Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory Thorough revisions of all remaining chapters Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software Two indices: An Index of Defined Terms and an Index of Cited Authors Greatly expanded bibliographies
A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms.
Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications.
New to the Second Edition
• Removal of all advanced material to be even more accessible in scope
• New fundamental material, including partition theory, generating functions, and combinatorial number theory
• Expanded coverage of random number generation, Diophantine analysis, and additive number theory
• More applications to cryptography, primality testing, and factoring
• An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing
Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.
Most available cryptology books primarily focus on either mathematics or history. Breaking this mold, Secret History: The Story of Cryptology gives a thorough yet accessible treatment of both the mathematics and history of cryptology. Requiring minimal mathematical prerequisites, the book presents the mathematics in sufficient detail and weaves the history throughout the chapters. In addition to the fascinating historical and political sides of cryptology, the author—a former Scholar-in-Residence at the U.S. National Security Agency (NSA) Center for Cryptologic History—includes interesting instances of codes and ciphers in crime, literature, music, and art.
Following a mainly chronological development of concepts, the book focuses on classical cryptology in the first part. It covers Greek and Viking cryptography, the Vigenère cipher, the one-time pad, transposition ciphers, Jefferson’s cipher wheel, the Playfair cipher, ADFGX, matrix encryption, World War II cipher systems (including a detailed examination of Enigma), and many other classical methods introduced before World War II.
The second part of the book examines modern cryptology. The author looks at the work of Claude Shannon and the origin and current status of the NSA, including some of its Suite B algorithms such as elliptic curve cryptography and the Advanced Encryption Standard. He also details the controversy that surrounded the Data Encryption Standard and the early years of public key cryptography. The book not only provides the how-to of the Diffie-Hellman key exchange and RSA algorithm, but also covers many attacks on the latter. Additionally, it discusses Elgamal, digital signatures, PGP, and stream ciphers and explores future directions such as quantum cryptography and DNA computing.
With numerous real-world examples and extensive references, this book skillfully balances the historical aspects of cryptology with its mathematical details. It provides readers with a sound foundation in this dynamic field.
Interesting examples highlight the interdisciplinary nature of this area
Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics.
Each chapter begins with a mathematical teaser to engage readers and includes a particularly surprising, stunning, elegant, or unusual result. The author covers the upward extension of Pascal’s triangle, a recurrence relation for powers of Fibonacci numbers, ways to make change for a million dollars, integer triangles, the period of Alcuin’s sequence, and Rook and Queen paths and the equivalent Nim and Wythoff’s Nim games. He also examines the probability of a perfect bridge hand, random tournaments, a Fibonacci-like sequence of composite numbers, Shannon’s theorems of information theory, higher-dimensional tic-tac-toe, animal achievement and avoidance games, and an algorithm for solving Sudoku puzzles and polycube packing problems. Exercises ranging from easy to challenging are found in each chapter while hints and solutions are provided in an appendix.
With over twenty-five years of teaching experience, the author takes an organic approach that explores concrete problems, introduces theory, and adds generalizations as needed. He delivers an absorbing treatment of the basic principles of discrete mathematics.
First introduced in 1995, Cryptography: Theory and Practice garnered enormous praise and popularity, and soon became the standard textbook for cryptography courses around the world. The second edition was equally embraced, and enjoys status as a perennial bestseller. Now in its third edition, this authoritative text continues to provide a solid foundation for future breakthroughs in cryptography.
WHY A THIRD EDITION?
The art and science of cryptography has been evolving for thousands of years. Now, with unprecedented amounts of information circling the globe, we must be prepared to face new threats and employ new encryption schemes on an ongoing basis. This edition updates relevant chapters with the latest advances and includes seven additional chapters covering:
Pseudorandom bit generation in cryptography
Entity authentication, including schemes built from primitives and special purpose "zero-knowledge" schemes
Key establishment including key distribution and protocols for key agreement, both with a greater emphasis on security models and proofs
Public key infrastructure, including identity-based cryptography
Secret sharing schemes
Multicast security, including broadcast encryption and copyright protection
Providing mathematical background in a "just-in-time" fashion, informal descriptions of cryptosystems along with more precise pseudocode, and a host of numerical examples and exercises, Cryptography: Theory and Practice, Third Edition offers comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the mind-boggling amount of information circulating around the world.
What if you had to take an art class in which you were only taught how to paint a fence? What if you were never shown the paintings of van Gogh and Picasso, weren't even told they existed? Alas, this is how math is taught, and so for most of us it becomes the intellectual equivalent of watching paint dry.
In Love and Math, renowned mathematician Edward Frenkel reveals a side of math we've never seen, suffused with all the beauty and elegance of a work of art. In this heartfelt and passionate book, Frenkel shows that mathematics, far from occupying a specialist niche, goes to the heart of all matter, uniting us across cultures, time, and space.
Love and Math tells two intertwined stories: of the wonders of mathematics and of one young man's journey learning and living it. Having braved a discriminatory educational system to become one of the twenty-first century's leading mathematicians, Frenkel now works on one of the biggest ideas to come out of math in the last 50 years: the Langlands Program. Considered by many to be a Grand Unified Theory of mathematics, the Langlands Program enables researchers to translate findings from one field to another so that they can solve problems, such as Fermat's last theorem, that had seemed intractable before.
At its core, Love and Math is a story about accessing a new way of thinking, which can enrich our lives and empower us to better understand the world and our place in it. It is an invitation to discover the magic hidden universe of mathematics.
Logic For Dummies tracks an introductory logic course at the college level. Concrete, real-world examples help you understand each concept you encounter, while fully worked out proofs and fun logic problems encourage you students to apply what you’ve learned.
Logically Fallacious is one of the most comprehensive collections of logical fallacies with all original examples and easy to understand descriptions, perfect for educators, debaters, or anyone who wants to improve his or her reasoning skills.
"Expose an irrational belief, keep a person rational for a day. Expose irrational thinking, keep a person rational for a lifetime." - Bo Bennett
The antidote to fuzzy thinking, with furry animals!
Have you read (or stumbled into) one too many irrational online debates? Ali Almossawi certainly had, so he wrote An Illustrated Book of Bad Arguments! This handy guide is here to bring the internet age a much-needed dose of old-school logic (really old-school, a la Aristotle).
Here are cogent explanations of the straw man fallacy, the slippery slope argument, the ad hominem attack, and other common attempts at reasoning that actually fall short—plus a beautifully drawn menagerie of animals who (adorably) commit every logical faux pas. Rabbit thinks a strange light in the sky must be a UFO because no one can prove otherwise (the appeal to ignorance). And Lion doesn’t believe that gas emissions harm the planet because, if that were true, he wouldn’t like the result (the argument from consequences).
Once you learn to recognize these abuses of reason, they start to crop up everywhere from congressional debate to YouTube comments—which makes this geek-chic book a must for anyone in the habit of holding opinions.
Combining stories of great writers and philosophers with quotations and riddles, this completely original text for first courses in mathematical logic examines problems related to proofs, propositional logic and first-order logic, undecidability, and other topics. 2013 edition.
In a clear, nontechnical manner, Cryptology: Classical and Modern with Maplets explains how fundamental mathematical concepts are the bases of cryptographic algorithms. Designed for students with no background in college-level mathematics, the book assumes minimal mathematical prerequisites and incorporates student-friendly Maplets throughout that provide practical examples of the techniques used.
By using the Maplets, students can complete complicated tasks with relative ease. They can encrypt, decrypt, and cryptanalyze messages without the burden of understanding programming or computer syntax. The authors explain topics in detail first before introducing one or more Maplets. All Maplet material and exercises are given in separate, clearly labeled sections. Instructors can omit the Maplet sections without any loss of continuity and non-Maplet examples and exercises can be completed with, at most, a simple hand-held calculator. The Maplets are available for download at www.radford.edu/~npsigmon/cryptobook.html.
A Gentle, Hands-On Introduction to Cryptology
After introducing elementary methods and techniques, the text fully develops the Enigma cipher machine and Navajo code used during World War II, both of which are rarely found in cryptology textbooks. The authors then demonstrate mathematics in cryptology through monoalphabetic, polyalphabetic, and block ciphers. With a focus on public-key cryptography, the book describes RSA ciphers, the Diffie–Hellman key exchange, and ElGamal ciphers. It also explores current U.S. federal cryptographic standards, such as the AES, and explains how to authenticate messages via digital signatures, hash functions, and certificates.
Contents include: Sets and Relations — Cantor's concept of a set, etc.
Natural Number Sequence — Zorn's Lemma, etc.
Extension of Natural Numbers to Real Numbers
Logic — the Statement and Predicate Calculus, etc.
Informal Axiomatic Mathematics
Boolean AlgebraInformal Axiomatic Set TheorySeveral Algebraic Theories — Rings, Integral Domains, Fields, etc.
First-Order Theories — Metamathematics, etc.
Symbolic logic does not figure significantly until the final chapter. The main theme of the book is mathematics as a system seen through the elaboration of real numbers; set theory and logic are seen s efficient tools in constructing axioms necessary to the system.
Mathematics students at the undergraduate level, and those who seek a rigorous but not unnecessarily technical introduction to mathematical concepts, will welcome the return to print of this most lucid work.
"Professor Stoll . . . has given us one of the best introductory texts we have seen." — Cosmos.
"In the reviewer's opinion, this is an excellent book, and in addition to its use as a textbook (it contains a wealth of exercises and examples) can be recommended to all who wish an introduction to mathematical logic less technical than standard treatises (to which it can also serve as preliminary reading)." — Mathematical Reviews.
In this book the author solves the problem of maintaining the interest of students at both levels by offering a combinatorial approach to elementary number theory. In studying number theory from such a perspective, mathematics majors are spared repetition and provided with new insights, while other students benefit from the consequent simplicity of the proofs for many theorems.
Among the topics covered in this accessible, carefully designed introduction are multiplicativity-divisibility, including the fundamental theorem of arithmetic, combinatorial and computational number theory, congruences, arithmetic functions, primitive roots and prime numbers. Later chapters offer lucid treatments of quadratic congruences, additivity (including partition theory) and geometric number theory.
Of particular importance in this text is the author's emphasis on the value of numerical examples in number theory and the role of computers in obtaining such examples. Exercises provide opportunities for constructing numerical tables with or without a computer. Students can then derive conjectures from such numerical tables, after which relevant theorems will seem natural and well-motivated..
The selection of topics conveys not only their role in this historical development of mathematics but also their value as bases for understanding the changing nature of mathematics. Among the topics covered in this wide-ranging text are: mathematics before Euclid, Euclid's Elements, non-Euclidean geometry, algebraic structure, formal axiomatics, the real numbers system, sets, logic and philosophy and more. The emphasis on axiomatic procedures provides important background for studying and applying more advanced topics, while the inclusion of the historical roots of both algebra and geometry provides essential information for prospective teachers of school mathematics.
The readable style and sets of challenging exercises from the popular earlier editions have been continued and extended in the present edition, making this a very welcome and useful version of a classic treatment of the foundations of mathematics. "A truly satisfying book." — Dr. Bruce E. Meserve, Professor Emeritus, University of Vermont.
The two-part selection of puzzles and paradoxes begins with examinations of the nature of infinity and some curious systems related to Gödel's theorem. The first three chapters of Part II contain generalized Gödel theorems. Symbolic logic is deferred until the last three chapters, which give explanations and examples of first-order arithmetic, Peano arithmetic, and a complete proof of Gödel's celebrated result involving statements that cannot be proved or disproved. The book also includes a lively look at decision theory, better known as recursion theory, which plays a vital role in computer science.
Hidden symmetries were first discovered nearly two hundred years ago by French mathematician évariste Galois. They have been used extensively in the oldest and largest branch of mathematics--number theory--for such diverse applications as acoustics, radar, and codes and ciphers. They have also been employed in the study of Fibonacci numbers and to attack well-known problems such as Fermat's Last Theorem, Pythagorean Triples, and the ever-elusive Riemann Hypothesis. Mathematicians are still devising techniques for teasing out these mysterious patterns, and their uses are limited only by the imagination.
The first popular book to address representation theory and reciprocity laws, Fearless Symmetry focuses on how mathematicians solve equations and prove theorems. It discusses rules of math and why they are just as important as those in any games one might play. The book starts with basic properties of integers and permutations and reaches current research in number theory. Along the way, it takes delightful historical and philosophical digressions. Required reading for all math buffs, the book will appeal to anyone curious about popular mathematics and its myriad contributions to everyday life.
The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.
This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite.
Beginning with a survey of set theory and its role in mathematics, the text proceeds to definitions and examples of categories and explains the use of arrows in place of set-membership. The introduction to topos structure covers topos logic, algebra of subobjects, and intuitionism and its logic, advancing to the concept of functors, set concepts and validity, and elementary truth. Explorations of categorial set theory, local truth, and adjointness and quantifiers conclude with a study of logical geometry.
Because these new developments in logical thought tended to perfect and sharpen the deductive method, an indispensable tool in many fields for deriving conclusions from accepted assumptions, the author decided to widen the scope of the work. In subsequent editions he revised the book to make it also a text on which to base an elementary college course in logic and the methodology of deductive sciences. It is this revised edition that is reprinted here.
Part One deals with elements of logic and the deductive method, including the use of variables, sentential calculus, theory of identity, theory of classes, theory of relations and the deductive method. The Second Part covers applications of logic and methodology in constructing mathematical theories, including laws of order for numbers, laws of addition and subtraction, methodological considerations on the constructed theory, foundations of arithmetic of real numbers, and more. The author has provided numerous exercises to help students assimilate the material, which not only provides a stimulating and thought-provoking introduction to the fundamentals of logical thought, but is the perfect adjunct to courses in logic and the foundation of mathematics.
Unlike many authors, however, Mr. Friedberg encourages students to think about the imaginative, playful qualities of numbers as they consider such subjects as primes and divisibility, quadratic forms and residue arithmetic and quadratic reciprocity and related theorems. Moreover, the author has included a number of unusual features to challenge and stimulate students: some of the original problems in Diophantus' Arithmetica, proofs of Fermat's Last Theorem for the exponents 3and 4, and two proofs of Wilson's Theorem.
Readers with a mathematical bent will enjoy and benefit from these entertaining and thought-provoking adventures in the fascinating realm of number theory. Mr. Friedberg is currently Professor of Physics at Barnard College, where he is Chairman of the Department of Physics and Astronomy.
"This book is a very specialized but broadly useful introduction to set theory. It is aimed at 'the beginning student of advanced mathematics' … who wants to understand the set-theoretic underpinnings of the mathematics he already knows or will learn soon. It is also useful to the professional mathematician who knew these underpinnings at one time but has now forgotten exactly how they go. … A good reference for how set theory is used in other parts of mathematics." — Allen Stenger, The Mathematical Association of America, September 2011.
The book begins with a systematic study of real numbers, understood to be a set of objects satisfying certain definite axioms. The concepts of a mathematical structure and an isomorphism are introduced in Chapter 2, after a brief digression on set theory, and a proof of the uniqueness of the structure of real numbers is given as an illustration. Two other structures are then introduced, namely n-dimensional space and the field of complex numbers.
After a detailed treatment of metric spaces in Chapter 3, a general theory of limits is developed in Chapter 4. Chapter 5 treats some theorems on continuous numerical functions on the real line, and then considers the use of functional equations to introduce the logarithm and the trigonometric functions. Chapter 6 is on infinite series, dealing not only with numerical series but also with series whose terms are vectors and functions (including power series). Chapters 7 and 8 treat differential calculus proper, with Taylor's series leading to a natural extension of real analysis into the complex domain. Chapter 9 presents the general theory of Riemann integration, together with a number of its applications. Analytic functions are covered in Chapter 10, while Chapter 11 is devoted to improper integrals, and makes full use of the technique of analytic functions.
Each chapter includes a set of problems, with selected hints and answers at the end of the book. A wealth of examples and applications can be found throughout the text. Over 340 theorems are fully proved.
After a brief overview, the approach begins with elementary toposes and advances to internal category theory, topologies and sheaves, geometric morphisms, and logical aspects of topos theory. Additional topics include natural number objects, theorems of Deligne and Barr, cohomology, and set theory. Each chapter concludes with a series of exercises, and an appendix and indexes supplement the text.
After reading this book, you should be able to use these tools to do some testing and even working on penetration projects. You just need to remember not to use these techniques in a production environment without having a formal approval.
The book begins with fundamentals, with a definition of complex numbers, their geometric representation, their algebra, powers and roots of complex numbers, set theory as applied to complex analysis, and complex functions and sequences. The notions of proper and improper complex numbers and of infinity are fully and clearly explained, as is stereographic projection. Individual chapters then cover limits and continuity, differentiation of analytic functions, polynomials and rational functions, Mobius transformations with their circle-preserving property, exponentials and logarithms, complex integrals and the Cauchy theorem , complex series and uniform convergence, power series, Laurent series and singular points, the residue theorem and its implications, harmonic functions (a subject too often slighted in first courses in complex analysis), partial fraction expansions, conformal mapping, and analytic continuation.
Elementary functions are given a more detailed treatment than is usual for a book at this level. Also, there is an extended discussion of the Schwarz-Christolfel transformation, which is particularly important for applications.
There is a great abundance of worked-out examples, and over three hundred problems (some with hints and answers), making this an excellent textbook for classroom use as well as for independent study. A noteworthy feature is the fact that the parentage of this volume makes it possible for the student to pursue various advanced topics in more detail in the three-volume original, without the problem of having to adjust to a new terminology and notation .
In this way, IntroductoryComplex Analysis serves as an introduction not only to the whole field of complex analysis, but also to the magnum opus of an important contemporary Russian mathematician.