Featured

**William Kocay, Donald L. Kreher**

September 26, 2016

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. W...

**Csaba D. Toth, Joseph O'Rourke, Jacob E. Goodman**

November 09, 2017

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use...

**Karin R Saoub**

October 30, 2017

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors. Rather than featuring formal mathematical proofs, the book focuses on explanations and logical reasoning. It also includes thoughtful discussions of historical problems and modern questions. The book...

**Andrew V. Sills**

October 12, 2017

The Rogers--Ramanujan identities are a pair of infinite series—infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator...

**Nicholas Loehr**

August 30, 2017

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics. The textbook emphasizes bijective proofs, which provide elegant solutions to counting problems by setting up one-to-one correspondences between two sets of...

**Silvia Heubach, Toufik Mansour**

June 14, 2017

A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance...

**Gabriel Valiente**

June 14, 2017

Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis...

**Richard A. Mollin**

June 07, 2017

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page...

**Kevin Ferland**

May 01, 2017

This book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs,...

**Victor Shcherbacov**

March 17, 2017

This book provides an introduction to quasigroup theory along with new structural results on some of the quasigroup classes. Many results are presented with some of them from mathematicians of the former USSR. These included results have not been published before in the western mathematical...

**Pierre-Loic Meliot**

March 16, 2017

Representation Theory of Symmetric Groups is the most up-to-date abstract algebra book on the subject of symmetric groups and representation theory. Utilizing new research and results, this book can be studied from a combinatorial, algorithmic or algebraic viewpoint. This book is an excellent way...

**Walter D. Wallis, John C. George**

January 12, 2017

What Is Combinatorics Anyway? Broadly speaking, combinatorics is the branch of mathematics dealing with different ways of selecting objects from a set or arranging objects. It tries to answer two major kinds of questions, namely, counting questions: how many ways can a selection or arrangement be...

**Nadia El Mrabet, Marc Joye**

December 08, 2016

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. As well as exploring the basic mathematical background of finite...