Discrete mathematics

A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.

Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.

Surveys trends arising from the applications and interactions between combinatorics, symbolic dynamics and theoretical computer science.

Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.

Surveys trends arising from the applications and interactions between combinatorics, symbolic dynamics and theoretical computer science.

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.

A broad survey written by acknowledged international experts in the field.

A broad survey written by acknowledged international experts in the field.

This book presents for the first time to a general readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem.

This book discusses representation theory of symmetric groups, theory of symmetric functions and polynomial representation theory of general linear groups.

This book presents for the first time to a general readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem.

This is the first book to cover the theory of noise sensitivity of Boolean functions with particular emphasis on critical percolation.

This book contains survey articles on modern topics related to the work of Harald Niederreiter, written by close colleagues and leading experts.

This book contains survey articles on modern topics related to the work of Harald Niederreiter, written by close colleagues and leading experts.

This is the first book to cover the theory of noise sensitivity of Boolean functions with particular emphasis on critical percolation.

This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming.

Accessible to all students with a sound background in high school mathematics, A Concise Introduction to Pure Mathematics, Fourth Edition presents some of the most fundamental and beautiful ideas in pure mathematics.

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).

Accessible to all students with a sound background in high school mathematics, A Concise Introduction to Pure Mathematics, Fourth Edition presents some of the most fundamental and beautiful ideas in pure mathematics.

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).

Representation Theory of Symmetric Groups is the most up-to-date abstract algebra book on the subject of symmetric groups and representation theory.

The tool for visualization is Microsoft Visual C++.

Big Data of Complex Networks presents and explains the methods from the study of big data that can be used in analysing massive structural data sets, including both very large networks and sets of graphs.

This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes.

The first part of this book introduces the Schubert Cells and varieties of the general linear group Gl (k^(r+1)) over a field k according to Ehresmann geometric way.

Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and the data structures that support them.

Model theory is one of the central branches of mathematical logic.

This book covers both theoretical and practical results for graph polynomials.

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike.

The Joy of Finite Mathematics: The Language and Art of Math teaches students basic finite mathematics through a foundational understanding of the underlying symbolic language and its many dialects, including logic, set theory, combinatorics (counting), probability, statistics, geometry, algebra, and finance.

Study smarter and stay on top of your discrete mathematics course with the bestselling Schaum's Outline-now with the NEW Schaum's app and website!

Study smarter and stay on top of your discrete mathematics course with the bestselling Schaum's Outline-now with the NEW Schaum's app and website!

Fully updated and revised edition of Csiszár and Körner''s classic book on information theory.

This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises.

This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.

This collaborative volume presents trends arising from the fruitful interaction between combinatorics on words, automata and number theory.

This book unifies and synthesizes research on graph structure over the last 25 years.

A self-contained introduction to the representation theory of the symmetric groups, including an exhaustive exposition of the Okounkov–Vershik approach.

Combinatorics meets number theory in this stimulating stroll through the zetas.

This collaborative volume presents trends arising from the fruitful interaction between combinatorics on words, automata and number theory.

This friendly introduction helps undergraduate students understand and appreciate matroid theory and its connections to geometry.