Discrete Mathematics

As the open-source and free alternative to expensive software like MapleTM, MathematicaR, and MATLABR, Sage offers anyone with a web browser the ability to use cutting-edge mathematical software and share the results with others, often with stunning...

Did you know that games and puzzles have given birth to many of today's deepest mathematical subjects? Now, with Douglas Ensley and Winston Crawley's Introduction to Discrete Mathematics, you can explore mathematical writing, abstract structures,...

This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming. Unlike most discrete mathematics texts focusing on one of the other, the book explores...

This volume contains nine survey articles based on plenary lectures given at the 28th British Combinatorial Conference, hosted online by Durham University in July 2021. This biennial conference is a well-established international event, attracting...

This textbook contains the mathematics needed to study computer science in application-oriented computer science courses. The content is based on the author's many years of teaching experience.The translation of the original German 7th edition Mathematik...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781009096225Author Anthony NixonFormat PaperbackPage Count 259Imprint Cambridge University PressPublisher Cambridge University Press

Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are...

Discrete Mathematics: Essentials and Applications offers a comprehensive survey of the area, particularly concentrating on the basic principles and applications of Discrete Mathematics. This up-to-date text provides proofs of significance, keeping the...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781032112039Author Bogumil KaminskiFormat HardbackPage Count 280Imprint CRC PressPublisher CRC PressWeight(grams) 157g

A collection of conference papers which discuss topics in computer mathematics. Subjects covered include: computations with rational parametric equations; theorem proving in Riemann geometry using Wu's method; and the finite basis of an irreducible...

Written for a broad audience of students in mathematics, computer science, operations research, statistics, and engineering, this textbook presents a short, lively survey of several fascinating non-calculus topics in modern applied mathematics. Coverage...

The theory of matroids is unique in the extent to which it connects such disparate branches of combinatorial theory and algebra as graph theory, lattice theory, design theory, combinatorial optimization, linear algebra, group theory, ring theory and...

Probabilistic Design for Optimization and Robustness: Presents the theory of modeling with variation using physical models and methods for practical applications on designs more insensitive to variation.Provides a comprehensive guide to optimization and...

The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of...

This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff's Nim, and on aspects of games with infinitesimal...

This volume contains survey articles based on the invited lectures given at the Twentieth British Combinatorial Conference, organised jointly by the University of Durham and the Open University. It was held in July 2005 at the University of Durham. This...

The British Combinatorial Conference is held every two years and is a key event for mathematicians worldwide working in combinatorics. In June 2003 the conference was held at the University of Wales, Bangor. The papers contained here are surveys...

The study of permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative combinatorics, model theory, the theory of automata and languages, and bioinformatics. Arising from...

This book presents the basic algorithms, the main theoretical results, and some applications of spectral methods. Particular attention is paid to the applications of spectral methods to nonlinear problems arising in fluid dynamics, quantum mechanics,...

The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the...

This is a revised edition of McEliece's classic, published with students in mind. It is a self-contained introduction to all basic results in the theory of information and coding. This theory was developed to deal with the fundamental problem of...

This introductory text explores the theory of graph spectra: a topic with applications across a wide range of subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those of the adjacency matrix,...

This book is a clear and lucid presentation of Evolutionary Algorithms, with a straightforward, bottom-up approach that provides the reader with a firm grasp of the basic principles of EAs. Covering the theory, history, mathematics, and applications of...

Solving problems in quantum mechanics is an essential skill and research activity for physicists, mathematicians, engineers and others. Nowadays, the labor of scientific computation has been greatly eased by the advent of computer algebra packages, which...

This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic...

Written for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs: the adjacency matrix, Laplacian matrix, signless Laplacian...

Over the past 25 years, there has been an explosion of interest in the area of random tilings. The first book devoted to the topic, this timely text describes the mathematical theory of tilings. It starts from the most basic questions (which planar...

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages. This is the only introductory book to cover such applications. It begins with a clear and readily understood exposition of...

Association schemes are of interest to both mathematicians and statisticians and this book was written with both audiences in mind. For statisticians, it shows how to construct designs for experiments in blocks, how to compare such designs, and how to...

This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical...

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has...

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of...

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

Harald Niederreiter's pioneering research in the field of applied algebra and number theory has led to important and substantial breakthroughs in many areas. This collection of survey articles has been authored by close colleagues and leading experts to...

This 1994 text covers finite linear spaces. It contains all the important results that had been published up to the time of publication, and is designed to be used not only as a resource for researchers in this and related areas, but also as a...

This volume contains nine survey articles based on the invited lectures given at the 23rd British Combinatorial Conference, held at Exeter in July 2011. This biennial conference is a well-established international event, with speakers from all over the...

Discrete-event simulation consists of a collection of techniques that when applied to a discrete-event dynamical system, generates sequences called sample paths that characterize its behavior. The collection includes modelling concepts for abstracting...

R is rapidly growing in popularity as the environment of choice for data analysis and graphics both in academia and industry. Lattice brings the proven design of Trellis graphics (originally developed for S by William S. Cleveland and colleagues at Bell...

Graph theory meets number theory in this stimulating book. Ihara zeta functions of finite graphs are reciprocals of polynomials, sometimes in several variables. Analogies abound with number-theoretic functions such as Riemann/Dedekind zeta functions. For...

Decision Theory An Introduction to Dynamic Programming and Sequential Decisions John Bather University of Sussex, UK Mathematical induction, and its use in solving optimization problems, is a topic of great interest with many applications. It enables us...