## Similar

Key features of Number Theory: Structures, Examples, and Problems:

* A rigorous exposition starts with the natural numbers and the basics.

* Important concepts are presented with an example, which may also emphasize an application. The exposition moves systematically and intuitively to uncover deeper properties.

* Topics include divisibility, unique factorization, modular arithmetic and the Chinese Remainder Theorem, Diophantine equations, quadratic residues, binomial coefficients, Fermat and Mersenne primes and other special numbers, and special sequences. Sections on mathematical induction and the pigeonhole principle, as well as a discussion of other number systems are covered.

* Unique exercises reinforce and motivate the reader, with selected solutions to some of the problems.

* Glossary, bibliography, and comprehensive index round out the text.

Written by distinguished research mathematicians and renowned teachers, this text is a clear, accessible introduction to the subject and a source of fascinating problems and puzzles, from advanced high school students to undergraduates, their instructors, and general readers at all levels.

Each main topic is treated in depth from its historical conception through to its status today. Many beautiful solutions have emerged for basic chessboard problems since mathematicians first began working on them in earnest over three centuries ago, but such problems, including those involving polyominoes, have now been extended to three-dimensional chessboards and even chessboards on unusual surfaces such as toruses (the equivalent of playing chess on a doughnut) and cylinders. Using the highly visual language of graph theory, Watkins gently guides the reader to the forefront of current research in mathematics. By solving some of the many exercises sprinkled throughout, the reader can share fully in the excitement of discovery.

Showing that chess puzzles are the starting point for important mathematical ideas that have resonated for centuries, Across the Board will captivate students and instructors, mathematicians, chess enthusiasts, and puzzle devotees.

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.

Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9 shows how to mix known algorithms and create new ones, while Chapter 10 presents the "Chop-Sticks" algorithm, used to obtain all minimum cuts in an undirected network without applying traditional maximum flow techniques. This algorithm has led to the new mathematical specialty of network algebra. The text assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates. 153 black-and-white illus. 23 tables. Exercises, with answers at the ends of chapters.

Translated from a well-known Russian work entitled Non-Elementary Problems in an Elementary Exposition, the chief aim of the book is to acquaint the readers with a variety of new mathematical facts, ideas, and methods. And while the majority of the problems represent questions in higher ("non-elementary") mathematics, most can be solved with elementary mathematics. In fact, for the most part, no knowledge of mathematics beyond a good high school course is required.

Volume One contains 100 problems, with detailed solutions, all dealing with probability theory and combinatorial analysis. Topics include the representation of integers as sums and products, combinatorial problems on the chessboard, geometric problems on combinatorial analysis, problems on the binomial coefficients, problems on computing probabilities, experiments with infinitely many possible outcomes, and experiments with a continuum of possible outcomes.

Volume Two contains 74 problems from various branches of mathematics, dealing with such topics as points and lines, lattices of points in the plane, topology, convex polygons, distribution of objects, nondecimal counting, theory of primes, and more. In both volumes the statements of the problems are given first, followed by a section giving complete solutions. Answers and hints are given at the end of the book.

Ideal as a text, for self-study, or as a working resource for a mathematics club, this wide-ranging compilation offers 174 carefully chosen problems that will test the mathematical acuity and problem-solving skills of almost any student, teacher, or mathematician.

László Lovász is a Senior Researcher in the Theory Group at Microsoft Corporation. He is a recipient of the 1999 Wolf Prize and the Gödel Prize for the top paper in Computer Science. József Pelikán is Professor of Mathematics in the Department of Algebra and Number Theory at Eötvös Loránd University, Hungary. In 2002, he was elected Chairman of the Advisory Board of the International Mathematical Olympiad. Katalin Vesztergombi is Senior Lecturer in the Department of Mathematics at the University of Washington.

Imhausen shows that from the earliest beginnings, pharaonic civilization used numerical techniques to efficiently control and use their material resources and labor. Even during the Old Kingdom, a variety of metrological systems had already been devised. By the Middle Kingdom, procedures had been established to teach mathematical techniques to scribes in order to make them proficient administrators for their king. Imhausen looks at counterparts to the notation of zero, suggests an explanation for the evolution of unit fractions, and analyzes concepts of arithmetic techniques. She draws connections and comparisons to Mesopotamian mathematics, examines which individuals in Egyptian society held mathematical knowledge, and considers which scribes were trained in mathematical ideas and why.

Of interest to historians of mathematics, mathematicians, Egyptologists, and all those curious about Egyptian culture, Mathematics in Ancient Egypt sheds new light on a civilization's unique mathematical evolution.

The contributors are Marco Abate, Marco Arizzi, Alexander Blokh, Thierry Bousch, Xavier Buff, Serge Cantat, Tao Chen, Robert Devaney, Alexandre Dezotti, Tien-Cuong Dinh, Romain Dujardin, Hugo García-Compeán, William Goldman, Rotislav Grigorchuk, John Hubbard, Yunping Jiang, Linda Keen, Jan Kiwi, Genadi Levin, Daniel Meyer, John Milnor, Carlos Moreira, Vincente Muñoz, Viet-Anh Nguyên, Lex Oversteegen, Ricardo Pérez-Marco, Ross Ptacek, Jasmin Raissy, Pascale Roesch, Roberto Santos-Silva, Dierk Schleicher, Nessim Sibony, Daniel Smania, Tan Lei, William Thurston, Vladlen Timorin, Sebastian van Strien, and Alberto Verjovsky.

Strengthening the analytic flavor of the book, this Second Edition:

Features a new chapter on analytic combinatorics and new sections on advanced applications of generating functions Demonstrates powerful techniques that do not require the residue theorem or complex integration Adds new exercises to all chapters, significantly extending coverage of the given topicsIntroduction to Enumerative and Analytic Combinatorics, Second Edition makes combinatorics more accessible, increasing interest in this rapidly expanding field.

Outstanding Academic Title of the Year, Choice magazine, American Library Association.

Discrete mathematics has the answer to these—and many other—questions of picking, choosing, and shuffling. T. S. Michael's gem of a book brings this vital but tough-to-teach subject to life using examples from real life and popular culture. Each chapter uses one problem—such as slicing a pizza—to detail key concepts about counting numbers and arranging finite sets. Michael takes a different perspective in tackling each of eight problems and explains them in differing degrees of generality, showing in the process how the same mathematical concepts appear in varied guises and contexts. In doing so, he imparts a broader understanding of the ideas underlying discrete mathematics and helps readers appreciate and understand mathematical thinking and discovery.

This book explains the basic concepts of discrete mathematics and demonstrates how to apply them in largely nontechnical language. The explanations and formulas can be grasped with a basic understanding of linear equations.

An exciting new direction for combinatorics, this book will interest graduate students and researchers working in mathematical subdisciplines requiring the mastery and practice of high-dimensional Ramsey theory.

Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics.

The Handbook of Applied Cryptography provides a treatment that is multifunctional:

It serves as an introduction to the more practical aspects of both conventional and public-key cryptography

It is a valuable source of the latest techniques and algorithms for the serious practitioner

It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit

It provides a mathematical treatment to accompany practical discussions

It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussed

Now in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.

Solutions to most principal network reliability problems—including medium-sized computer networks—are presented in the form of efficient Monte Carlo algorithms and illustrated with numerical examples and tables. Written by reliability experts with significant teaching experience, this reader-friendly text is an excellent resource for software engineering, operations research, industrial engineering, and reliability engineering students, researchers, and engineers.

Stressing intuitive explanations and providing detailed proofs of difficult statements, this self-contained resource includes a wealth of end-of-chapter exercises, numerical examples, tables, and offers a solutions manual—making it ideal for self-study and practical use.

Key features of Putnam and Beyond

* Preliminary material provides an overview of common methods of proof: argument by contradiction, mathematical induction, pigeonhole principle, ordered sets, and invariants.

* Each chapter systematically presents a single subject within which problems are clustered in every section according to the specific topic.

* The exposition is driven by more than 1100 problems and examples chosen from numerous sources from around the world; many original contributions come from the authors.

* Complete solutions to all problems are given at the end of the book. The source, author, and historical background are cited whenever possible.

This work may be used as a study guide for the Putnam exam, as a text for many different problem-solving courses, and as a source of problems for standard courses in undergraduate mathematics. Putnam and Beyond is organized for self-study by undergraduate and graduate students, as well as teachers and researchers in the physical sciences who wish to to expand their mathematical horizons.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

The book contains close to150 figures produced with lattice. Many of the examples emphasize principles of good graphical design; almost all use real data sets that are publicly available in various R packages. All code and figures in the book are also available online, along with supplementary material covering more advanced topics.

Key features:

* Introductory chapters present the main ideas and topics in graph theory—walks, paths and cycles, radius, diameter, eccentricity, cuts and connectivity, trees

* Subsequent chapters examine specialized topics and applications

* Numerous examples and illustrations

* Comprehensive index and bibliography, with suggested literature for more advanced material

New to the second edition:

* New chapters on labeling and communications networks and small-worlds

* Expanded beginner’s material in the early chapters, including more examples, exercises, hints and solutions to key problems

* Many additional changes, improvements, and corrections throughout resulting from classroom use and feedback

Striking a balance between a theoretical and practical approach with a distinctly applied flavor, this gentle introduction to graph theory consists of carefully chosen topics to develop graph-theoretic reasoning for a mixed audience. Familiarity with the basic concepts of set theory, along with some background in matrices and algebra, and a little mathematical maturity are the only prerequisites.

-----

From a review of the first edition:

"Altogether the book gives a comprehensive introduction to graphs, their theory and their application...The use of the text is optimized when the exercises are solved. The obtained skills improve understanding of graph theory as well... It is very useful that the solutions of these exercises are collected in an appendix."

—Simulation News Europe

This book describes existing and advanced methods to reduce the dimensionality of numerical databases. For each method, the description starts from intuitive ideas, develops the necessary mathematical details, and ends by outlining the algorithmic implementation. Methods are compared with each other with the help of different illustrative examples.

The purpose of the book is to summarize clear facts and ideas about well-known methods as well as recent developments in the topic of nonlinear dimensionality reduction. With this goal in mind, methods are all described from a unifying point of view, in order to highlight their respective strengths and shortcomings.

The book is primarily intended for statisticians, computer scientists and data analysts. It is also accessible to other practitioners having a basic background in statistics and/or computational learning, like psychologists (in psychometry) and economists.

Numerous captivating integer sequences arise along the way, but also many open questions impose themselves. Central among these is the famed Frame-Stewart conjecture. Despite many attempts to decide it and large-scale numerical experiments supporting its truth, it remains unsettled after more than 70 years and thus demonstrates the timeliness of the topic.

Enriched with elaborate illustrations, connections to other puzzles and challenges for the reader in the form of (solved) exercises as well as problems for further exploration, this book is enjoyable reading for students, educators, game enthusiasts and researchers alike.

Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applications. The final part addresses more sophisticated cryptographic applications, including LFSR-based stream ciphers and index calculus methods.

Accounting for the impact of current computer architectures, this book explores the algorithmic and implementation aspects of cryptanalysis methods. It can serve as a handbook of algorithmic methods for cryptographers as well as a textbook for undergraduate and graduate courses on cryptanalysis and cryptography.

Throughout the book students are encouraged to express their ideas, conjectures, and conclusions in writing. The goal is to help readers develop a host of new mathematical tools that will be useful beyond the classroom and in a number of disciplines.

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.

Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:

Adds more than 160 new exercises Presents many new concepts, theorems, and examples Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach’s Conjecture on graph decompositions Supplies a proof of the perfect graph theorem Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the textAt the end of the book are indices and lists of mathematicians’ names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption.

Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject’s fascinating history while covering a host of interesting problems and diverse applications.

Written by international mathematics authorities, the book first examines the invariant of Castelnuovo-Mumford regularity, blowup algebras, and bigraded rings. It then outlines the current status of two challenging conjectures: the lex-plus-power (LPP) conjecture and the multiplicity conjecture. After reviewing results of the geometry of Hilbert functions, the book considers minimal free resolutions of integral subschemes and of equidimensional Cohen-Macaulay subschemes of small degree. It also discusses relations to subspace arrangements and the properties of the infinite graded minimal free resolution of the ground field over a projective toric ring. The volume closes with an introduction to multigraded Hilbert functions, mixed multiplicities, and joint reductions.

By surveying exciting topics of vibrant current research, Syzygies and Hilbert Functions stimulates further study in this hot area of mathematical activity.

To give students a better idea of what the subject covers, the authors first discuss several examples of typical combinatorial problems. They also provide basic information on sets, proof techniques, enumeration, and graph theory—topics that appear frequently throughout the book. The next few chapters explore enumerative ideas, including the pigeonhole principle and inclusion/exclusion. The text then covers enumerative functions and the relations between them. It describes generating functions and recurrences, important families of functions, and the theorems of Pólya and Redfield. The authors also present introductions to computer algebra and group theory, before considering structures of particular interest in combinatorics: graphs, codes, Latin squares, and experimental designs. The last chapter further illustrates the interaction between linear algebra and combinatorics. Exercises and problems of varying levels of difficulty are included at the end of each chapter.

Ideal for undergraduate students in mathematics taking an introductory course in combinatorics, this text explores the different ways of arranging objects and selecting objects from a set. It clearly explains how to solve the various problems that arise in this branch of mathematics.

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.

Understanding Physics and Physical Chemistry Using Formal Graphs is organized according to the structures emerging from formal graphs, from simple to elaborate, providing after each series of case studies the theoretical elements necessary for understanding their common features. More than 80 case studies are tackled in domains ranging from translational mechanics to Newtonian gravitation to chemical reactions.

With the help of this new tool, the modeling of physical phenomena becomes a fascinating cross-disciplinary exploration. The graphs encourage a visual, unified comprehension of the relationships between physical concepts and variables, properties, and operators. Out-of-the-box and thought provoking, this book inspires lively discussions and fruitful thinking about the connections between mechanics, chemical reactivity, electrodynamics, thermodynamics, and more.

The text is primarily intended for use in a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix–Tree Theorem, and the Sperner property. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees.

Richard Stanley is currently professor of Applied Mathematics at the Massachusetts Institute of Technology. Stanley has received several awards including the George Polya Prize in applied combinatorics, the Guggenheim Fellowship, and the Leroy P. Steele Prize for mathematical exposition. Also by the author: Combinatorics and Commutative Algebra, Second Edition, © Birkhauser.

The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all Threshold Graphs and Related Topics provides a valuable source of information for all those working in this field.

This monograph follows the Greek tradition in seeking beautiful shapes such as regular convex polyhedra. The primary aim is to convey to the reader how algebraic topology is effectively used to explore the rich world of crystal structures. Graph theory, homology theory, and the theory of covering maps are employed to introduce the notion of the topological crystal which retains, in the abstract, all the information on the connectivity of atoms in the crystal. For that reason the title Topological Crystallography has been chosen.

Topological crystals can be described as “living in the logical world, not in space,” leading to the question of how to place or realize them “canonically” in space. Proposed here is the notion of standard realizations of topological crystals in space, including as typical examples the crystal structures of diamond and lonsdaleite. A mathematical view of

the standard realizations is also provided by relating them to asymptotic behaviors of random walks and harmonic maps. Furthermore, it can be seen that a discrete analogue of algebraic geometry is linked to the standard realizations.Applications of the discussions in this volume include not only a systematic enumeration of crystal structures, an area of considerable scientific interest for many years, but also the architectural design of lightweight rigid structures. The reader therefore can see the agreement of theory and practice.