Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revisionLast revisionBoth sides next revision | ||
category_mathematics [2021-06-11 14:25] – timbo | category_mathematics [2021-06-12 12:13] – nik | ||
---|---|---|---|
Line 43: | Line 43: | ||
==== Table Seatings ==== | ==== Table Seatings ==== | ||
- | arranging a group into a number of tables so that everyone sits with everyone else. | + | see [[table seating]] |
- | + | ||
- | A strict version is an affine plane. | + | |
- | More generally we want a resolvable 2-design. Resovable is the parallelism. Maybe there is something like discrete hyperbolic geometry to deal with this, but we seem to have better combinatorial ideas below. | + | |
- | https:// | + | |
- | + | ||
- | Strict versions include Kirkman' | + | |
- | https:// | + | |
- | https:// | + | |
- | + | ||
- | In other cases we need to either allow people not to meet, or to meet more often. | + | |
- | + | ||
- | The Dagstuhl Happy Diner problem is the version where everyone meets at least once. | + | |
- | https:// | + | |
- | https:// | + | |
- | + | ||
- | Equitable Resolvable coverings seem also to be a more strict form, where we try to allow people to meet at most twice. | + | |
- | https:// | + | |
- | https:// | + | |
- | + | ||
- | If we have people sitting at round tables and only interacting with their neighbours, then we have the Oberwolfach Problem: | + | |
- | https:// | + | |
- | + | ||