Discrete Mathematics

Catalan numbers are probably the most ubiquitous sequence of numbers in mathematics. This book gives for the first time a comprehensive collection of their properties and applications to combinatorics, algebra, analysis, number theory, probability...

Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey...

Praise for the Third Edition "Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book." - MAA Reviews Maintaining a standard of excellence that establishes The Probabilistic Method as...

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is...

A magician appears able to banish chaos at will: a deck of cards arranged in order is shuffled--apparently randomly--by a member of the audience. Then, hey presto! The deck is suddenly put back in its original order! Magic tricks like this are easy to...

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and...

This second edition of Invitation to Discrete Mathematics is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of...

In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a...

This is an introduction to the mathematics involved in the intriguing field of cryptology, the science of writing and reading secret messages which are designed to be read only by their intended recipients. It is written at an elementary level, suitable...

This book gives a lively development of the mathematics needed to answer the question, ""How many times should a deck of cards be shuffled to mix it up?"" The shuffles studied are the usual ones that real people use: riffle, overhand, and smooshing cards...

This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included...

Includes access to student companion website. Updated to align to the latest 2013 ACM/IEEE Computer Science curricula, Discrete Structures, Logic, and Computability, Fourth Edition is designed for the one- to two-term Discrete Mathematics course. The...

One of the traditional ways mathematical ideas and even new areas of mathematics are created is from experiments. One of the best-known examples is that of the Fermat hypothesis, which was conjectured by Fermat in his attempts to find integer solutions...

This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its...

The format of this book is unique in that it combines features of a traditional text with those of a problem book. The material is presented through a series of problems, about 250 in all, with connecting text; this is supplemented by a further 250...

This is the first full-length book on the major theme of symmetry in graphs. Forming part of algebraic graph theory, this fast-growing field is concerned with the study of highly symmetric graphs, particularly vertex-transitive graphs, and other...

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486832814Author Amy BabichFormat PaperbackPage Count 256Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams) 355gDimensions(mm)...

Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the...

Uniquely blends mathematical theory and algorithm design for understanding and modeling real-world problems Optimization modeling and algorithms are key components to problem-solving across various fields of research, from operations research and...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486681313Author Rutherford ArisFormat PaperbackPage Count 288Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams)...

Computers are everywhere today--at work, in the bank, in artist's studios, sometimes even in our pockets--yet they remain to many of us objects of irreducible mystery. How can today's computers perform such a bewildering variety of tasks if computing is...

This fundamental monograph introduces both the probabilistic and algebraic aspects of information theory and coding. It has evolved from the authors' years of experience teaching at the undergraduate level, including several Cambridge Maths Tripos...

Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curves connecting them. The main message of this book is that such a representation is not merely a way to visualize the graph, but an important mathematical...

Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form,...

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant...

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486498065Author Gould GouldFormat PaperbackPage Count 352Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams) 458gDimensions(mm)...

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving...

SageMath, or Sage for short, is an open-source mathematical software system based on the Python language and developed by an international community comprising hundreds of teachers and researchers, whose aim is to provide an alternative to the commercial...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781511650977Author Kapoo StemFormat PaperbackPage Count 204Imprint Createspace Independent Publishing PlatformPublisher Createspace Independent Publishing...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781987630008Author Mohamed-Kareem I ElminyawiFormat PaperbackPage Count 112Imprint Createspace Independent Publishing PlatformPublisher Createspace...

Quantum algorithms are among the most important, interesting, and promising innovations in information and communication technology. They pose a major threat to today's cybersecurity and at the same time promise great benefits by potentially solving...

Generalized permutahedra are polytopes that arise in combinatorics, algebraic geometry, representation theory, topology, and optimization. They possess a rich combinatorial structure. Out of this structure we build a Hopf monoid in the category of...

This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781534970748Author Oscar LevinFormat PaperbackPage Count 346Imprint Createspace Independent Publishing PlatformPublisher Createspace Independent Publishing...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9798691721755Author Themathemaths Ease PressFormat PaperbackPage Count 54Imprint Independently PublishedPublisher Independently PublishedWeight(grams) 216g

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781511653541Author Kapoo StemFormat PaperbackPage Count 204Imprint Createspace Independent Publishing PlatformPublisher Createspace Independent Publishing...

Parabola is a mathematics magazine published by UNSW, Sydney. Among other things, each issue of Parabola has contained a collection of puzzles/problems, on various mathematical topics and at a suitable level for younger (but mathematically sophisticated)...

This book constitutes the referred proceedings of the 24th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2024, held as part of EvoStar 2024, in Aberystwyth, UK, during April 3–5, 2024. The 12 full papers presented...