References

1

B. Aspvall and F. M. Liang. The dinner table problem. Technical Report STAN-CS-80-8222, Computer Science Department, Stanford University, Stanford, California, 1980.

2

J. H. Conway. An enumeration of knots and links, and some of their algebraic properties. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 329-358. Pergamon, Oxford, 1970.

3

M. E. Fisher. Statistical mechanics of dimers on a plane lattice. Phys. Rev., 124:1664-1672, 1961.

4

E. N. Gilbert. Knots and classes of ménage permutations. Scripta Math., 22:228-233, 1956.

5

I. Kaplansky. Solution of the problème des ménages. Bull. Amer. Math. Soc., 49:784-785, 1943.

6

I. Kaplansky and J. Riordan. The problème des ménages. Scripta Mathematica, 12:113-124, 1946.

7

P. W. Kasteleyn. Dimer statistics and phase transitions. J. Math. Phys., 4:287-293, 1963.

8

E. Lucas. Théorie des nombres. Gauthier-Villars, Paris, 1891.

9

J. Riordan. An Introduction to Combinatorial Analysis. Wiley, New York, 1958.

10

D. Robbins. The probability that neighbors remain neighbors after random rearrangements. Amer. Math. Monthly, 87:122-124, 1980.

11

H. J. Ryser. Combinatorial Mathematics. Mathematical Association of America, Washington, D. C., 1963.

12

P. G. Tait. On knots, i, ii, iii. In Scientific Papers, pages 273-347. Cambridge Univ. Press, Cambridge, 1898.

13

J. Touchard. Sur un problème des permutations. C. R. Acad. Sciences Paris, 198:631-633, 1934.

14

H. Wilf. What is an answer? Amer. Math. Monthly, 89:289-292, 1982.