Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision | ||
| category_mathematics [2007-07-05 08:48] – nik | category_mathematics [2021-06-12 11:52] – [Table Seatings] nik | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| ==== unsystematic ==== | ==== unsystematic ==== | ||
| - | < | ||
| Universe ⊆ Complexity \\ | Universe ⊆ Complexity \\ | ||
| Complexity ⊆ Math \\ | Complexity ⊆ Math \\ | ||
| Math ⊆ Universe | Math ⊆ Universe | ||
| - | </ | ||
| an introduction to the mathematics of the infinite http:// | an introduction to the mathematics of the infinite http:// | ||
| Line 15: | Line 13: | ||
| * [[Game Theory]] | * [[Game Theory]] | ||
| * [[Fluid Dynamics]] | * [[Fluid Dynamics]] | ||
| + | * [[Mathematical Matter]] | ||
| * [[MathWorld]] | * [[MathWorld]] | ||
| - | * geometry/ | + | * geometry/ |
| - | * [[TopologyNotes]], etc+ | + | * [[Topology Notes]], etc+ |
| * [[Orbifolds]] | * [[Orbifolds]] | ||
| * [[Hyperbolic Geometry]] | * [[Hyperbolic Geometry]] | ||
| - | * [[KnotPlot]] / [[PinchedKnot]] | + | * [[KnotPlot]] / [[Pinched Knot]] |
| * [[Geometry Notes]] | * [[Geometry Notes]] | ||
| * [[Number System]](s) | * [[Number System]](s) | ||
| Line 39: | Line 38: | ||
| * "A Computational Introduction to Number Theory and Algebra" | * "A Computational Introduction to Number Theory and Algebra" | ||
| * various online textbooks > http:// | * various online textbooks > http:// | ||
| + | |||
| + | |||
| + | |||
| + | ==== Table Seatings ==== | ||
| + | |||
| + | see [[table seating]] | ||
| + | |||
| + | arranging a group into a number of tables so that everyone sits with everyone else. | ||
| + | |||
| + | 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:// | ||
| + | |||
| + | |||
| + | |||
nik