Amazon cover image
Image from Amazon.com
Image from Google Jackets

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

By: Contributor(s): Material type: TextTextSeries: Student mathematical library, v. 53Publication details: Providence, R.I. : American Mathematical Society, ©2010.Description: x, 182 pages : illustrations ; 22 cmISBN:
  • 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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Barcode
Mathematics Departmental Library 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.
Previous
Back to results
Next
Close
Share
© Copyright Shiv Nadar University 2012. All Rights Reserved.  Disclaimer |  Sitemap
The Shiv Nadar University has been established under U.P. Act No 12 of 2011. Shiv Nadar University is UGC Approved.