Year: 2016
Type: preprint
Abstract: In this note we count linear arrangements that avoid certain patterns and show their connection to the derangement numbers. We discuss the sequence Dn, which counts linear arrangements that avoid patterns 12, 23, ..., (n-1)n, n1, and show that this sequence almost follows the derangement sequence itself since the number of its odd terms is one more than the derangement numbers while the number of its even terms is one less. We also express the derangement numbers in terms of these and other arrangements.
Source: arXiv (Cornell University)
Author: Navarrete, Enrique
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2528360678