Counting of even and odd restricted permutations

Vladimir Baltić, Dragan Stevanović

Abstract


Let p be a permutation of the set Nn = {1, 2, …, n}. We introduce techniques for counting N(n; k; r; I; π), the number of even or odd restricted permutations of Nn satisfying the conditions  − k ≤ p(i) − i ≤ r (for arbitrary natural numbers k and r) and p(i) − i ∉ I (for some set I) and π = 0 for even permutations and π = 1 for odd permutations.


Keywords


Even and odd restricted permutations, exact enumeration, recurrences, permanents.

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.661.ab7

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications