Timetabling with Birkhoff and von Neumann
Abstract
An application of the Birkhoff–von Neumann theorem to the problem of writing a school timetable is discussed. A combinatorial result on the number of decompositions of 3x3 matrices of a certain type as sums of permutation matrices is proved.
Fields of Study & Subjects
Scheduling and Timetabling Solutions
Advanced Combinatorial Mathematics
Finite Group Theory Research
Publication details
- Journal / source
- The Mathematical Gazette
- Pages
- 1–11
- Publication date
- 19 January 2026
- Language
- EN