This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revisionBoth sides next revision |
| table_seating [2024-04-11 10:15] – [Strict] nik | table_seating [2024-04-11 10:17] – [Strict] nik |
|---|
| Versions include [[https://en.wikipedia.org/wiki/Kirkman%27s_schoolgirl_problem|Kirkman's Schoolgirl Problem]] (15 children walk in groups of 3, can they do this so that all pairs of girls walk together exactly once over a whole week) {[[https://oeis.org/search?q=schoolgirl&sort=&language=german&go=Suche|oeis]]}. This is the question as to resolvable $(v,3,1) 2-designs$, which if I understand it, exist $\iff v = 3 mod 6$. | Versions include [[https://en.wikipedia.org/wiki/Kirkman%27s_schoolgirl_problem|Kirkman's Schoolgirl Problem]] (15 children walk in groups of 3, can they do this so that all pairs of girls walk together exactly once over a whole week) {[[https://oeis.org/search?q=schoolgirl&sort=&language=german&go=Suche|oeis]]}. This is the question as to resolvable $(v,3,1) 2-designs$, which if I understand it, exist $\iff v = 3 mod 6$. |
| |
| For pairs, resolvable $(v,2,1) 2\dash{}designs$ exist only for even v, v >= 4. | For pairs, resolvable $(v,2,1) 2--designs$ exist only for even v, v >= 4. |
| |
| Table size 4: Resolvable (v,k,1)- 2-designs. | Table size 4: Resolvable (v,k,1)- 2-designs. |
nik