Thirty-three miniatures : mathematical an d algorithmic applications of linear algebra / Jiří Matoussek

By:

Matousek, Jifi, 1963

Contributor(s):

Matoušek, Jiří

Material type: Text

9781470454845

Subject(s):

DDC classification:

512.5 MAT

Contents:

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.

Summary: 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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Barcode
Mathematics Departmental Library	SNU LIBRARY	512.5 MAT (Browse shelf(Opens below))	Available	M045

Total holds: 0

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.

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

There are no comments on this title.

to post a comment.

Place hold
Print
Cite
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com)