Permanents

This 1978 book gives an account of the theory of permanents, their history and applications. The volume was the first complete account of the theory of permanents, covering virtually the whole of the subject, a feature that no simple survey of the theory of matrices can even attempt.

No detailed description available for "Random Permanents".

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 properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves.

A paperback edition for the student market, this standard work of reference has been a bestseller for over 70 years. It is an essential tool for anyone with a professional or leisure interest in the care of animals. Much more than a list of veterinary terms, its practical approach ensures that readers gain an insight into the signs and symptoms of common, and less common, diseases, as well as their diagnosis and treatment. For this edition much new and updated information has been included, reflecting the numerous developments that have taken place in animal care and husbandry, and welfare. There is greatly expanded coverage of topics relating to popular breeds of dog and cat, and the inheritable conditions that might affect their health. Advances in medicine, surgery and diagnostic techniques; descriptions of newly identified diseases such as Schmallenberg virus; the resurgence of old scourges such as TB in cattle, and ongoing enzootic infections such as bird flu are also included in this edition. The growing risk of exotic diseases such as heartworm being imported following the relaxation of travel arrangements for dogs and cats is reflected in new entries. Notes on many new species being farmed or kept as companion animals are among the thousands of topics covered.

2

Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.

Contributed articles.