注重体验与质量的电子书资源下载网站
分类于: 职场办公 云计算&大数据
简介
Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra 豆 9.1分
资源最后更新于 2020-07-26 15:38:14
作者:Jiří Matoušek
出版社:American Mathematical Socity
出版日期:2010-01
ISBN:9780821849774
文件格式: pdf
标签: 数学 线性代数 算法 代数 Linear_Algebra 数学科学 Trick Mathematics
简介· · · · · ·
This volume 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. The topics includ...
目录
Cover 1
Title page 2
Contents 4
Preface 6
Notation 10
Fibonacci numbers, quickly 12
Fibonacci numbers, the formula 14
The clubs of Oddtown 16
Same-size intersections 18
Error-correcting codes 22
Odd distances 28
Are these distances Euclidean? 30
Packing complete bipartite graphs 34
Equiangular lines 38
Where is the triangle? 42
Checking matrix multiplication 46
Tiling a rectangle by squares 50
Three Petersens are not enough 52
Petersen, Hoffman–Singleton, and maybe 57 56
Only two distances 62
Covering a cube minus one vertex 66
Medium-size intersection is hard to avoid 68
On the difficulty of reducing the diameter 72
The end of the small coins 78
Walking in the yard 82
Counting spanning trees 88
In how many ways can a man tile a board? 96
More bricks—more walls? 108
Perfect matchings and determinants 118
Turning a ladder over a finite field 124
Counting compositions 130
Is it associative? 136
The secret agent and umbrella 142
Shannon capacity of the union: a tale of two fields 150
Equilateral sets 158
Cutting cheaply using eigenvectors 164
Rotating the cube 174
Set pairs and exterior products 182
Index 190
Back Cover 194
Title page 2
Contents 4
Preface 6
Notation 10
Fibonacci numbers, quickly 12
Fibonacci numbers, the formula 14
The clubs of Oddtown 16
Same-size intersections 18
Error-correcting codes 22
Odd distances 28
Are these distances Euclidean? 30
Packing complete bipartite graphs 34
Equiangular lines 38
Where is the triangle? 42
Checking matrix multiplication 46
Tiling a rectangle by squares 50
Three Petersens are not enough 52
Petersen, Hoffman–Singleton, and maybe 57 56
Only two distances 62
Covering a cube minus one vertex 66
Medium-size intersection is hard to avoid 68
On the difficulty of reducing the diameter 72
The end of the small coins 78
Walking in the yard 82
Counting spanning trees 88
In how many ways can a man tile a board? 96
More bricks—more walls? 108
Perfect matchings and determinants 118
Turning a ladder over a finite field 124
Counting compositions 130
Is it associative? 136
The secret agent and umbrella 142
Shannon capacity of the union: a tale of two fields 150
Equilateral sets 158
Cutting cheaply using eigenvectors 164
Rotating the cube 174
Set pairs and exterior products 182
Index 190
Back Cover 194