The dinner table problem: the rectangular case

Details The dinner table problem: the rectangular case The dinner table problem: the rectangular case

2005-07-14

arxiv.org/abs/math/0507293v1

Mathematics

Combinatorics

10 pages

Scientific paper

$n$ people are seated randomly at a rectangular table with $\lfloor n/2\rfloor$ and $\lceil n/2\rceil$ seats along the two opposite sides for two dinners. What's the probability that neighbors at the first dinner are no more neighbors at the second one? We give an explicit formula and we show that its asymptotic behavior as $n$ goes to infinity is $e^{-2}(1+4/n)$ (it is known that it is $e^{-2}(1-4/n)$ for a round table). A more general permutation problem is also considered.

Affiliated with

Also associated with

No associations

Rating

The dinner table problem: the rectangular case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The dinner table problem: the rectangular case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The dinner table problem: the rectangular case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575490