Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline .
This second edition of Mathematical Olympiad Treasures contains a stimulating collection of problems in geometry and trigonometry, algebra, number theory, and combinatorics.
"e;102 Combinatorial Problems"e; consists of carefully selected problems that have been used in the training and testing of the USA International Mathematical Olympiad (IMO) team.
Over the course of the last century, the systematic exploration of the relationship between Fourier analysis and other branches of mathematics has lead to important advances in geometry, number theory, and analysis, stimulated in part by Hurwitz's proof of the isoperimetric inequality using Fourier series.
The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field.
Ramsey theory is a relatively "e;new,"e; approximately 100 year-old direction of fascinating mathematical thought that touches on many classic fields of mathematics such as combinatorics, number theory, geometry, ergodic theory, topology, combinatorial geometry, set theory, and measure theory.
"e;This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Polya and Tarjan at Stanford University.
Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure.
Number theory, an ongoing rich area of mathematical exploration, is noted for its theoretical depth, with connections and applications to other fields from representation theory, to physics, cryptography, and more.
Graph theory continues to be one of the fastest growing areas of modern mathematics because of its wide applicability in such diverse disciplines as computer science, engineering, chemistry, management science, social science, and resource planning.
Questions of maxima and minima have great practical significance, with applications to physics, engineering, and economics; they have also given rise to theoretical advances, notably in calculus and optimization.
Foundations of Diatonic Theory: A Mathematically Based Approach to Music Fundamentals is an introductory, undergraduate-level textbook that provides an easy entry point into the challenging field of diatonic set theory, a division of music theory that applies the techniques of discrete mathematics to the properties of diatonic scales.
Adopting a student-centered approach, this book anticipates and addresses the common challenges that students face when learning abstract concepts like limits, continuity, and inequalities.
Combinatorial research has proceeded vigorously in Russia over the last few decades, based on both translated Western sources and original Russian material.
Introduction to Modern Cryptography, the most relied-upon textbook in the field, provides a mathematically rigorous yet accessible treatment of this fascinating subject.
A self-contained introduction to the representation theory of the symmetric groups, including an exhaustive exposition of the Okounkov–Vershik approach.
Computer and Information Security Handbook, Fourth Edition offers deep coverage of an extremely wide range of issues in computer and cybersecurity theory, along with applications and best practices, offering the latest insights into established and emerging technologies and advancements.
Designed both for those who seek an acquaintance with dynamic programming and for those wishing to become experts, this text is accessible to anyone who's taken a course in operations research.
Employing a practical, "e;learn by doing"e; approach, this first-rate text fosters the development of the skills beyond the pure mathematics needed to set up and manipulate mathematical models.
This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis.
