2005/07/14 by Roberto Tauraso, Tauraso, Roberto
Mathematics · #05A05 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05
paper · pdf · doi:10.48550/arxiv.math/0507293
10 pages
arxiv created 2005/07/14 · arxiv updated 2009/12/01
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.