Seating Derangements without Horizontal Displacement
Main Article Content
Abstract
This paper investigates the permutations of seating arrangements where individuals can only move to adjacent seats, without any horizontal displacement. We consider a grid consisting of 𝑚 rows and 𝑛 columns, with each seat occupied by a single person. The allowed movements are restricted to vertical or diagonal shifts to neighboring seats. We establish recurrence relations to determine the number of possible seating derangements for given values of m and n. Solutions to these recurrence relations are provided. Additionally, we extend our analysis to larger grids of size 2𝑚 × 𝑛, subject to the same movement constraints.
Article Details

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Eriksen N, Freij R, Wästlund J. Enumeration of Derangements with Descents in Prescribed Positions. The Electronic Journal of Combinatorics, 2009; 16(1): #R32.
Honsberger R. In Polya’s Footsteps: Miscellaneous Problems and Essays, Dolciani Mathematical Exposition No. 19. MAA, New York, USA, 1997.
Kennedy RE, Cooper C. Variation on a Five-by-Five Seating Rearrangement Problem. Mathematics in College, Fall-Winter, New York, 1993; 59–67.
Otake T, Kennedy RE, Cooper C. On a Seating Rearrangement Problem. Mathematics and Informatics Quarterly, 1996; 52, 63–71.
Sirivoravit M, Leerawat U. The 2×𝑛 Seating Derangements. Cogent Mathematics & Statistics, 2018; 5: 1492887.