Year: 2016
Type: preprint
Abstract: In this note we continue the analysis of permutations that avoid substrings j(j+k), 1 <= j <= n-k, k < n, as well as substrings j(j+k) (mod n), 1 <= j <= n. In the first case the number of such permutations can be obtained from recursions starting from derangement numbers, while in the (mod n) case the number of permutations depends on whether n is prime, and more generally, on whether n and k are relatively prime.
Source: arXiv (Cornell University)
Author: Navarrete, Enrique
Institution: Universidad de Antioquia
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2531978111