Year: 2026
Type: article
Abstract: We provide a combinatorial proof for the fact that the numbers of derangements of length n form a log-convex sequence for n≥3. A minor modification of our proof yields the same result for permutations of length n≥4 that have exactly one fixed point. We explain why these statements do not generalize for permutations with exactly k fixed points where k≥3.
Source: Axioms
Author: Miklós Bóna
Institution: University of Florida
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,896
OpenAlex ID: W7147010038