DeepRead
Cover of Thirty-three miniatures

Thirty-three miniatures

Jiří Matoušek · 2010

Mathematics and physics › Geometry and geometric algebra

#9,873 most recommended

About the book

A collection of thirty-three short expositions, published in the AMS Student Mathematical Library series, showing how linear algebra solves problems in combinatorics, discrete geometry and the theory of algorithms. It is aimed at students who already know the basics of linear algebra and want to see it used in unexpected settings. The central claim is that linear-algebraic tools such as dimension counting, rank arguments, determinants and eigenvalues can yield short proofs and sharp bounds for problems that look purely combinatorial or geometric. Each miniature isolates one such technique and applies it to a concrete problem, so the collection argues for the method as much as for any single result.

Written by Claude from what it knows of this book.

What Hacker News says 67% recommend · 0% critical

00.5120132015202020252013 peak · 1
This bookAverage book in Geometry and geometric algebra

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2010
ISBN
9780821849774
Editions known
2 at Open Library
Open Library
OL18548613W

Algebras, linearLinear Algebras

Explore in the mosaic

Read next: its neighbours on the mosaic