Thirty three miniatures mathematical algorithmic (15 risultati)

Paperback. Condizione: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Condizione: New.

Condizione: New.

Condizione: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Condizione: new.

Soft cover. Condizione: New. Contents: Preface. Notation. 1. Fibonacci Numbers, Quickly. 2. Fibonacci Numbers, the Formula. 3. The Clubs of Odd town. 4. Same-Size Intersections. 5. Error-Correcting Codes. 6. Odd Distances. 7. Are These Distances Euclidean? 8. Packing Complete Bipartite Graphs. 9. Equiangular Lines. 10. Where is the Triangle? 11. Checking Matrix Multiplication. 12. Tiling a Rectangle by Squares. 13. Three Petersens Are Not Enough. 14. Petersen, Hoffman Singleton, and Maybe 57. 15. Only Two Distances. 16. Covering a Cube Minus One Vertex. 17. Medium-Size Intersection Is Hard To Avoid. 18. On the Difficulty of Reducing the Diameter. 19. The End of the Small Coins. 20. Walking in the Yard. 21. Counting Spanning Trees. 22. In How Many Ways Can a Man Tile a Board? 23. More Bricks More Walls? 24. Perfect Matchings and Determinants. 25. Turning a Ladder Over a Finite Field. 26. Counting Compositions. 27. Is It Associative? 28. The Secret Agent and the Umbrella. 29. Shannon Capacity of the Union: A Tale of Two Fields. 30. Equilateral Sets. 31. Cutting Cheaply Using Eigenvectors. 32. Rotating the Cube. 33. Set Pairs and Exterior Products. Index. 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 Lovász 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. …

Condizione: New. Series: Student Mathematical Library. Num Pages: 182 pages, Illustrations. BIC Classification: PBMW. Category: (UU) Undergraduate. Dimension: 216 x 140 x 11. Weight in Grams: 238. . 2010. Paperback. . . . .

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. Series: Student Mathematical Library. Num Pages: 182 pages, Illustrations. BIC Classification: PBMW. Category: (UU) Undergraduate. Dimension: 216 x 140 x 11. Weight in Grams: 238. . 2010. Paperback. . . . . Books ship from the US and Ireland.

Condizione: New.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

paperback. Condizione: Gut. 182 Seiten; 9780821849774.3 Gewicht in Gramm: 500.