Grok a Book

Thirty-three Miniatures

Mathematical and Algorithmic Applications of Linear Algebra

Jiří Matoušek

About the book

Thirty-three short chapters, each a self-contained application of linear algebra to combinatorics, geometry or algorithms: from the odd-town theorem and the number of spanning trees to Shannon capacity and fast matrix multiplication. Our first reading group, and the one that set the daily-cadence format.

Prerequisites

A first course in linear algebra.

Sessions

28 of 28 sessions were recorded. Dates are IST.

  1. 1 Nov Session 01 provisional ▶ 29 min
  2. 2 Nov Session 02 provisional ▶ 30 min
  3. 4 Nov Session 03 provisional ▶ 38 min
  4. 4 Nov Session 04 provisional ▶ 30 min
  5. 5 Nov Session 05 provisional ▶ 49 min
  6. 6 Nov Session 06 provisional ▶ 51 min
  7. 8 Nov Session 07 provisional ▶ 44 min
  8. 8 Nov Session 08 provisional ▶ 43 min
  9. 9 Nov Session 09 provisional ▶ 44 min
  10. 12 Nov Session 10 provisional ▶ 27 min
  11. 11 Nov Session 11 provisional ▶ 46 min
  12. 14 Nov Session 12 provisional ▶ 1 h 01 min
  13. 14 Nov Session 13 provisional ▶ 50 min
  14. 16 Nov Session 15 provisional ▶ 52 min
  15. 17 Nov Session 16 provisional ▶ 38 min
  16. 19 Nov Session 17 provisional ▶ 1 h 02 min
  17. 20 Nov Session 18 provisional ▶ 1 h 05 min
  18. 22 Nov Session 19 provisional ▶ 1 h 08 min
  19. 23 Nov Session 20 provisional ▶ 1 h 08 min
  20. 25 Nov Session 21 provisional ▶ 1 h 14 min
  21. 25 Nov Session 22 provisional ▶ 1 h 07 min
  22. 26 Nov Session 23 provisional ▶ 1 h 12 min
  23. 28 Nov Session 24 provisional ▶ 1 h 20 min
  24. 29 Nov Session 25 provisional ▶ 1 h 05 min
  25. 29 Nov Session 26 provisional ▶ 1 h 01 min
  26. 1 Dec Session 27 provisional ▶ 1 h 03 min
  27. 2 Dec Session 28 provisional ▶ 1 h 17 min
  28. 3 Dec Session 29 provisional ▶ 1 h 23 min