scispace - formally typeset
Open AccessBook

Notes on introductory combinatorics

Reads0
Chats0
TLDR
Plya and Tarjan as mentioned in this paper presented a day-by-day transcription of a course on combinatorics at Stanford University, where elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Plyas Theory of Counting, are covered, as well as analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.
Abstract
Developed from the authors introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Plyas Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths. This introduction will provide students with a solid foundation in the subject. ---- "This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Plya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhuser publishers produced a very pleasant text. One can count on [Plya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G. Plya." Zentralblatt MATH (Review of the original hardcover edition)

read more

Citations
More filters
Book

Limits to Parallel Computation: P-Completeness Theory

TL;DR: In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.
Journal ArticleDOI

An efficient algorithm for the “optimal” stable marriage

TL;DR: By exploiting the structure of the set of all stable matchings, and using graph-theoretic methods, an O(n4) algorithm for this problem is derived and achieves the objective of maximizing the average “satisfaction” of all people.
Journal ArticleDOI

Constraint-based watermarking techniques for design IP protection

TL;DR: Watermarking-based IP protection as mentioned in this paper addresses IP protection by tracing unauthorized reuse and making untraceable unauthorized reuse as difficult as recreating given pieces of IP from scratch, where a watermark is a mechanism for identification that is nearly invisible to human and machine inspection; difficult to remove; and permanently embedded as an integral part of the design.
Journal ArticleDOI

Linear programming brings marital bliss

TL;DR: In this article, the authors describe the convex hull of the incidence vectors of stable matchings and propose a linear program to solve the optimal stable marriage problem as a linear programming problem.
Journal ArticleDOI

The interlace polynomial of a graph

TL;DR: The interlace graph polynomial as discussed by the authors is a special case of the Martin polynomials of an isotropic system, which underlies its connections with the circuit partition polynomorphism and the Kauffman brackets of a link diagram.