- Book
- x, 182 p. : ill. ; 22 cm.
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 include a number of well-known mathematical gems, such as Hamming codes, the matrix-tree theorem, the Lovasz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture, as well as other, perhaps less popular but similarly beautiful results, e.g., fast associativity testing, a lemma of Steinitz on ordering vectors, a monotonicity result for integer partitions, or a bound for set pairs via exterior products. The simpler results in the first part of the book provide ample material to liven up an undergraduate course of linear algebra. The more advanced parts can be used for a graduate course of linear-algebraic methods or for seminar presentations. Table of 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 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; Index. (STML/53).
(source: Nielsen Book Data)9780821849774 20160604
(source: Nielsen Book Data)9780821849774 20160604
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 include a number of well-known mathematical gems, such as Hamming codes, the matrix-tree theorem, the Lovasz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture, as well as other, perhaps less popular but similarly beautiful results, e.g., fast associativity testing, a lemma of Steinitz on ordering vectors, a monotonicity result for integer partitions, or a bound for set pairs via exterior products. The simpler results in the first part of the book provide ample material to liven up an undergraduate course of linear algebra. The more advanced parts can be used for a graduate course of linear-algebraic methods or for seminar presentations. Table of 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 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; Index. (STML/53).
(source: Nielsen Book Data)9780821849774 20160604
(source: Nielsen Book Data)9780821849774 20160604
Science Library (Li and Ma)
Science Library (Li and Ma) | Status |
---|---|
Stacks | |
QA184.2 .M38 2010 | Unknown On reserve at Li and Ma Science Library 2-hour loan |
QA184.2 .M38 2010 | Unknown On reserve at Li and Ma Science Library 2-hour loan |
MATH-61DM-01
- Course
- MATH-61DM-01 -- Modern Mathematics: Discrete Methods
- Instructor(s)
- Fox, Jacob
- Book
- vii, 132 p. : ill. ; 24 cm.
- Linear algebra
- Analysis in Rn
- More linear algebra
- More analysis in Rn
- Introductory lectures on real analysis.
- Linear algebra
- Analysis in Rn
- More linear algebra
- More analysis in Rn
- Introductory lectures on real analysis.
dx.doi.org Synthesis Digital Library
- dx.doi.org Synthesis Digital Library
- Google Books (Full view)
Science Library (Li and Ma)
Science Library (Li and Ma) | Status |
---|---|
Stacks | |
QA184.2 .S57 2008 | Unknown On reserve at Li and Ma Science Library 2-hour loan |
MATH-61CM-01, MATH-61DM-01
- Course
- MATH-61CM-01 -- Modern Mathematics: Continuous Methods
- Instructor(s)
- Mazzeo, Rafe R
- Course
- MATH-61DM-01 -- Modern Mathematics: Discrete Methods
- Instructor(s)
- Fox, Jacob