Showing all 20 results
Combinatorial games are games of pure strategy involving two players, with perfect information and no element of chance. Starting from the very basics of gameplay and strategy, the authors cover a wide range of topics, from game algebra to special classes of games. Classic techniques are introduced and applied in novel ways to analyze both old and new games, several appearing for the first time in this book.
The book presents a class of new results in molecular biology for which topological methods and ideas are important. These include: the large-scale conformation properties of DNA; computational methods allowing the simulation of large-scale properties of DNA; the tangle model of DNA recombination and other applications of Knot theory; dynamics of supercoiled DNA and biocatalitic properties of DNA; the structure of proteins; and other very recent problems in molecular biology.
Since the discovery of neutrino oscillations neutrino physics has become an interesting field of research in physics. They imply that neutrino must have a small mass and that the neutrinos, coupled to the charged leptons, are mixtures of the mass eigenstates, analogous to the flavor mixing of the quarks. The mixing angles for the quarks are small, but for the leptons two of the mixing angles are large. The masses of the three neutrinos must be very small, less than 1 eV, but from the oscillation experiments we only know the mass differences – the absolute masses are still unknown.
Putnam and Beyond takes the reader on a journey through the world of college mathematics, focusing on some of the most important concepts and results in the theories of polynomials, linear algebra, real analysis in one and several variables, differential equations, coordinate geometry, trigonometry, elementary number theory, combinatorics, and probability.
Study of "graph operators" or "graph-valued functions" such as the line graph, the clique graph, the complement, and powers, raises several immediate questions: Which graphs are fixed under the operator? Which graphs appear as images of graphs? What happens if the operator is iterated? Over the last 30 years these questions have been answered and methods developed for particular operators in literally hundreds of papers on the subject. Nowhere, however, could one find a comprehensive treatment-a unification of terminology, questions, and methods.G
Through examples of large complex graphs in realistic networks, research in graph theory has been forging ahead into exciting new directions. Graph theory has emerged as a primary tool for detecting numerous hidden structures in various information networks, including Internet graphs, social networks, biological networks, or, more generally, any graph representing relations in massive data sets. How will we explain from first principles the universal and ubiquitous coherence in the structure of these realistic but complex networks? In order to analyze these large sparse graphs, we use combinatorial, probabilistic, and spectral methods, as well as new and improved tools to analyze these networks.
The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature. Addressing this gap, Algebraic Curves in Cryptography explores the rich uses of algebraic curves in a range of cryptographic applications, such as secret sharing, frameproof codes, and broadcast encryption.Suitable for researchers and graduate students in mathematics and computer science, this self-contained book is one of the first to focus on many topics in cryptography involving algebraic curves.
This advanced textbook covers the central topics in game theory and provides a strong basis from which readers can go on to more advanced topics. The subject matter is approached in a mathematically rigorous, yet lively and interesting way. New definitions and topics are motivated as thoroughly as possible. Coverage includes the idea of iterated Prisoner’s Dilemma (super games) and challenging game-playing computer programs.
How do you convey to your students, colleagues and friends some of the beauty of the kind of mathematics you are obsessed with? If you are a mathematician interested in finite or topological geometry and combinatorial designs, you could start by showing them some of the (400+) pictures in the "picture book". Pictures are what this book is all about; original pictures of everybody’s favorite geometries such as configurations, projective planes and spaces, circle planes, generalized polygons, mathematical biplanes and other designs which capture much of the beauty, construction principles, particularities, substructures and interconnections of these geometries.
The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnology, data communication, and DNA computing.
Discrete Mathematics is one of the fastest growing areas in mathematics today with an ever-increasing number of courses in schools and universities. Graphs and Applications is based on a highly successful Open University course and the authors have paid particular attention to the presentation, clarity and arrangement of the material, making it ideally suited for independent study and classroom use.
This handbook describes advances in large scale network studies that have taken place in the past 5 years since the publication of the Handbook of Graphs and Networks in 2003. It covers all aspects of large-scale networks, including mathematical foundations and rigorous results of random graph theory, modeling and computational aspects of large-scale networks, as well as areas in physics, biology, neuroscience, sociology and technical areas. Applications range from microscopic to mesoscopic and macroscopic models.T
Group theoretic problems have propelled scientific achievements across a wide range of fields, including mathematics, physics, chemistry, and the life sciences. Many cryptographic constructions exploit the computational hardness of group theoretical problems, and the area is viewed as a potential source of quantum-resilient cryptographic primitives for the future. Group Theoretic Cryptography supplies an ideal introduction to cryptography for those who are interested in group theory and want to learn about the possible interplays between the two fields.
Once the privilege of a secret few, cryptography is now taught at universities around the world. Introduction to Cryptography with Open-Source Software illustrates algorithms and cryptosystems using examples and the open-source computer algebra system of Sage. The author, a noted educator in the field, provides a highly practical learning experience by progressing at a gentle pace, keeping mathematics at a manageable level, and including numerous end-of-chapter exercises.Focusing on the cryptosystems themselves rather than the means of breaking them, the book first explores when and how the methods of modern cryptography can be used and misused.
Easily Accessible to Students with Nontechnical Backgrounds 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.Technology ResourceBy using the Maplets, students can complete complicated tasks with relative ease.
From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems. Codes: The Guide to Secrecy from Ancient to Modern Times explores the depth and breadth of the field, remaining accessible to the uninitiated while retaining enough rigor for the seasoned cryptologist.
Cryptography is an outstanding book that covers all the major areas of cryptography in a readable, mathematically precise form. Several chapters deal with especially active areas of research and give the reader a quick introduction and overview of the basic results in the area.
Continuing a bestselling tradition, An Introduction to Cryptography, Second Edition provides a solid foundation in cryptographic concepts that features all of the requisite background material on number theory and algorithmic complexity as well as a historical look at the field.With numerous additions and restructured material, this edition presents the ideas behind cryptography and the applications of the subject. The first chapter provides a thorough treatment of the mathematics necessary to understand cryptography, including number theory and complexity, while the second chapter discusses cryptographic fundamentals, such as ciphers, linear feedback shift registers, modes of operation, and attacks.
Der Band behandelt die aktuellen Techniken der modernen Kryptographie wie Verschlüsselung und digitale Signaturen. Alle mathematischen Grundlagen werden anhand zahlreicher Beispiele und Übungen behandelt, so dass Lesern ein fundiertes Verständnis der modernen Kryptographie vermittelt wird. In die 5. Auflage hat der Autor die Beweise für die Sicherheit des Lamport-Diffie-Einmalsignaturverfahrens und des Merkle-Signaturverfahrens sowie einen Abschnitt über algebraische Angriffe auf Blockchiffren neu aufgenommen.
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.
Showing all 20 results