Accession Number:

ADA099175

Title:

The Diner Table Problem,

Descriptive Note:

Corporate Author:

STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1980-12-01

Pagination or Media Count:

14.0

Abstract:

This report contains two papers inspired by the dinner table problem If n people are seated randomly around a circular table for two meals, what is the probability that no two people sit together at both meals We show that this probability approaches 1e-squared as n approaches infinity, and also give a closed form. We then observe that in many similar problems on permutations with restricted position, the number of permutations satisfying a given number of properties is approximately Poisson distributed. We generalize our asymptotic argument to prove such a limit theorem, and mention applications to the problems of derangements, menages, and the asymptotic number of Latin rectangles. Author

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE