TY  - BOOK
AU  - Matousek, Jifi, 1963
AU  - Matoušek, Jiří,
TI  - Thirty-three miniatures : mathematical an: d algorithmic applications of linear algebra
T2  - Student mathematical library, v. 53
SN  - 9781470454845
U1  - 512.5 MAT 
PY  - 2010///
CY  - Providence, R.I. 
PB  - : American Mathematical Society
KW  - Mathematics
KW  - Algebra
KW  - Kombinatorik
KW  - Linjär algebra
KW  - Lineare Algebra -- Lehrmittel
N1  - Fibonacci numbers, quickly --
Fibonacci numbers, the formula --
The clubs of Oddtown --
Same-size intersections --
Error-correcting codes --
Odd distances --
Are these distances Euclidean? --
Packing complete bipartite graphs --
Equiangular lines --
Where is the triangle? --
Checking matrix multiplication --
Tiling a rectangle by squares --
Three Petersens are not enough --
Petersen, Hoffman-Singleton, and maybe 57 --
Only two distances --
Covering a cube minus one vertex --
Medium-size intersection is hard to avoid --
On the difficulty of reducing the diameter --
The end of the small coins --
Walking in the yard --
Counting spanning trees --
In how many ways can a man tile a board? --
More bricks --
more walls? --
Perfect matchings and determinants --
Turning a ladder over a finite field --
Counting compositions --
Is it associative? --
The secret agent and the umbrella --
Shannon capacity of the union: a tale of two fields --
Equilateral sets --
Cutting cheaply using Eigenvectors --
Rotating the cube --
Set pairs and exterior products
N2  - Contains a collection of clever mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof in at most ten pages and can be read independently of all other chapters (with minor exceptions), assuming only a modest background in linear algebra. --from publisher description
ER  -