MathDB
Count all nonincreasing functions with no fixed points

Source: 2019 Baltic Way P9

November 18, 2019
functioncombinatoricsEnumerative Combinatorics

Problem Statement

For a positive integer nn, consider all nonincreasing functions f : \{1,\hdots,n\}\to\{1,\hdots,n\}. Some of them have a fixed point (i.e. a cc such that f(c)=cf(c) = c), some do not. Determine the difference between the sizes of the two sets of functions.
Remark. A function ff is nonincreasing if f(x)f(y)f(x) \geq f(y) holds for all xyx \leq y