Year: 2027
Type: article
Abstract: In this article, we apply the transfer matrix method to the unfriendly seating arrangement problem, a discrete parking process on a line n sites. This approach recovers the Padovan sequence as the enumeration of admissible jamming configurations and refines the count according to the number of occupied sites. As a further consequence, we derive new identities involving the Padovan sequence and its self-convolution.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W7235461553
