Bøker av Jiri Matousek

Contains a collection of mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof, and assumes only a modest background in linear algebra. The topics include Hamming codes, the matrix-tree theorem, the Lovasz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture.

What is the "most uniform" way of distributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? This book is an accessible and lively introduction to the area of geometric discrepancy theory.

A clear and self-contained introduction to discrete mathematics for undergraduates and early graduates.

The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". One of its main goals is to help the reader to see linear programming "behind the scenes".

To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.