Discrete Mathematics

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

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

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

Advances in Domain Adaptation Theory gives current, state-of-the-art results on transfer learning, with a particular focus placed on domain adaptation from a theoretical point-of-view. The book begins with a brief overview of the most popular concepts...

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

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

The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these...

Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the...

Concisely written, gentle introduction to graph theory suitable as a textbook or for self-study Graph-theoretic applications from diverse fields (computer science, engineering, chemistry, management science) 2nd ed. includes new chapters on labeling and...

In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet linked to continued fractions which would go onto be known as Christoffel words. Some years later, Andrey Markoff published his famous theory, the now called...

This book provides an introduction to discrete mathematics. At the end of the book the reader should be able to answer counting questions such as: How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that...

This text originated as a lecture delivered November 20, 1984, at Queen's University, in the undergraduate colloquium senes. In another colloquium lecture, my colleague Morris Orzech, who had consulted the latest edition of the Guinness Book of Records,...

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 text on very large scale computation in the 21st century covers such topics as: challenges in the natural sciences and physics; chemistry; fluid dynamics; astrophysics; biology; challenges in engineering; challenges in algorithm design; and...

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and...

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and...

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

Sorry no description is available for this book at this time.