Discrete Mathematics

Design theory is a branch of combinatorics with applications in number theory, coding theory and geometry. In this book the authors discuss the generalization of results and applications to quasi-symmetric designs. The coverage is comprehensive and will...

This volume is dedicated to Paul Erdos, who profoundly influenced mathematics in the twentieth century, with over 1200 papers in number theory, complex analysis, probability theory, geometry, interpretation theory, algebra set theory and combinatorics...

This volume contains the invited lectures given at the Twelfth British Combinatorical Conference. The lectures survey the many areas of current research activity in combinatorics and its applications, including graph theory, designs, and probabilistic...

Symmetric designs are an important class of combinatorial structures which arose first in the statistics and are now especially important in the study of finite geometries. This book presents some of the algebraic techniques that have been brought to...

The articles collected here are the texts of the invited lectures given at the Eighth British Combinatorial Conference held at University College, Swansea. The contributions reflect the scope and breadth of application of combinatorics, and are...

Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe,...

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational...

Random matrices arise from, and have important applications to, number theory, probability, combinatorics, representation theory, quantum mechanics, solid state physics, quantum field theory, quantum gravity, and many other areas of physics and...

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs,...

This book is a continuation of Theory of Matroids (also edited by Neil White), and again consists of a series of related surveys that have been contributed by authorities in the area. The volume begins with three chapters on coordinatisations, followed...

Bipartite graphs are perhaps the most basic of objects in graph theory, both from a theoretical and practical point of view. However, sometimes they have been considered only as a special class in some wider context. This book deals solely with bipartite...

This book presents the salient features of the general theory of infinite electrical networks in a coherent exposition. Using the basic tools of functional analysis and graph theory, the author examines the fundamental developments in the field and...

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be...

The British Combinatorial Conference is held every two years and is now a key event for mathematicians worldwide, working in combinatorics. This volume is published on the occasion of the 18th meeting, which was held 1st-6th July 2001 at the University...

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

Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations researchBook...

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

These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other...

This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal...

A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum...

The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on "Emerging Applications of...

During 1996-7 MSRI held a full academic year program on Combinatorics, with special emphasis on the connections with other branches of mathematics, such as algebraic geometry, topology, commutative algebra, representation theory, and convex geometry. The...

The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as...

From rather modest beginnings, the British Combinatorial Conference grew into an established biennial international gathering. A successful format for the series of conferences was established, whereby several distinguished mathematicians were invited to...

This second edition of A Beginner's Guide to Finite Mathematics takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Topics are presented sequentially: the book opens with a brief review of sets and numbers,...

During 1996-7 MSRI held a full academic year program on Combinatorics, with special emphasis on the connections with other branches of mathematics, such as algebraic geometry, topology, commutative algebra, representation theory, and convex geometry. The...

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

This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, and well-developed examples for applications of the branch-and-bound paradigm to important problems in combinatorial...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9780966355420Author Klaus TruemperFormat PaperbackPage Count 410Imprint Leibniz CompanyPublisher Leibniz CompanyWeight(grams) 544g

This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, and well-developed examples for applications of the branch-and-bound paradigm to important problems in combinatorial...

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering...

This book is based on a set of lectures given to a mixed audience of physicists and mathematicians. The desire to be intelligible to both groups is the underlying preoccupation of the author. Physicists nowadays are particularly interested in phase...

Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of...

Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of...

Finite arrangements of convex bodies were intensively investigated in the second half of the twentieth century. Connections to many other subjects were made, including crystallography, the local theory of Banach spaces, and combinatorial optimisation...

This volume provides a relatively accessible introduction to its subject that captures the essential ideas of transfiniteness for graphs and networks.Book InformationISBN 9780817641948Author Armen H. ZemanianFormat HardbackPage Count 183Imprint...

This book contains translations of papers from the second volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe- rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was...

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

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

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