Kategoria BISAC: Mathematics >> Combinatorics

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations.

Originally published in 1980.

The Princeton Legacy Library uses the latest print-on-demand technology to again...

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research.

The volume is recommended to experienced...

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions.

The text is appropriate for...

A Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas. Topological combinatorics is concerned with solutions to combinatorial problems by applying topological tools. In most cases these solutions are very elegant and the connection between combinatorics and topology often arises as an unexpected surprise.

The textbook covers topics...

Graph-Theoretical Matrices in Chemistry presents a systematic survey of graph-theoretical matrices and highlights their potential uses. This comprehensive volume is an updated, extended version of a former bestseller featuring a series of mathematical chemistry monographs. In this edition, nearly 200 graph-theoretical matrices are included.

This second edition is organized like the previous one after an introduction, graph-theoretical matrices are presented in five chapters: The Adjacency Matrix and Related Matrices, Incidence Matrices, The Distance Matrix and...

Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of magic ideas have been applied to graphs. Recently there has been a resurgence of interest in magic labelings due to a number of results that have applications to the problem of decomposing graphs into trees.

Key features of this second edition include:

. a new chapter on magic labeling of directed graphs

. applications of theorems from graph theory and interesting counting arguments

. new research problems and exercises covering a range of...

The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn.

These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide...

From the reviews of the previous editions

..".. The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic...