Discrete Mathematics

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)...

First published in 1968, An Introduction to Harmonic Analysis has firmly established itself as a classic text and a favorite for students and experts alike. Professor Katznelson starts the book with an exposition of classical Fourier series. The aim is...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486483689Author Gary ChartrandFormat PaperbackPage Count 464Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams)...

There are certain rules that one must abide by in order to create a successful sequel. - Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of...

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...

The design of code and cipher systems has undergone major changes in modern times. Powerful personal computers have resulted in an explosion of e-banking, e-commerce and e-mail, and as a consequence the encryption of communications to ensure security has...

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...

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...

This textbook covers topics of undergraduate mathematics in abstract algebra, geometry, topology and analysis with the purpose of connecting the underpinning key ideas. It guides STEM students towards developing knowledge and skills to enrich their...

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...

An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how...

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...

From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory...

A reprint of one of the classic volumes on racetrack efficiency, this book is the only one in its field that deals with the racetrack betting market in-depth, containing all the important historical papers on racetrack efficiency. As evidenced by the...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781887187145Author J Richard HollosFormat PaperbackPage Count 184Imprint Abrazol PublishingPublisher Abrazol PublishingWeight(grams) 221gDimensions(mm)...

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...

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in...

Mahler measure, a height function for polynomials, is the central theme of this book. It has many interesting properties, obtained by algebraic, analytic and combinatorial methods. It is the subject of several longstanding unsolved questions, such as...

Tangles offer a precise way to identify structure in imprecise data. By grouping qualities that often occur together, they not only reveal clusters of things but also types of their qualities: types of political views, of texts, of health conditions, or...

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...

Combinatorics is a broad and important area of mathematics, and this textbook provides the beginner with the ideal introduction to many of the different aspects of the subject. By building up from the basics, and demonstrating the relationships between...

Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two,...

The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who...

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...

In an attempt to introduce application scientists and graduate students to the exciting topic of positive definite kernels and radial basis functions, this book presents modern theoretical results on kernel-based approximation methods and demonstrates...

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486485935Author Edward ScheinermanFormat PaperbackPage Count 240Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams)...

Cryptography plays a crucial role in many aspects of today's world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both...

Matroid theory is a vibrant area of research that provides a unified way to understand graph theory, linear algebra and combinatorics via finite geometry. This book provides the first comprehensive introduction to the field which will appeal to...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780486439464Author Edward a BenderFormat PaperbackPage Count 256Imprint Dover Publications Inc.Publisher Dover Publications Inc.Weight(grams)...

This lively introductory text exposes the student in the humanities to the world of discrete mathematics. A problem-solving based approach grounded in the ideas of George Polya are at the heart of this book. Students learn to handle and solve new...

Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science...

The Baseball Mysteries: Challenging Puzzles for Logical Detectives is a book of baseball puzzles, logical baseball puzzles. To jump in, all you need is logic and a casual fan's knowledge of the game. The puzzles are solved by reasoning from the rules of...

Counting is hard. "Counting" is short for "Enumerative Combinatorics," which certainly doesn't sound easy. This book provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to... . At the end of the...

Fortran remains one of the principal programming languages used in high-performance scientific, numerical, and engineering computing. A series of significant revisions to the standard versions of the language have progressively enhanced its capabilities,...

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 book provides a comprehensive, in-depth overview of elementary mathematics as explored in Mathematical Olympiads around the world. It expands on topics usually encountered in high school and could even be used as preparation for a first-semester...

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9...