Combinatorial results for the symmetric inverse semigroup

In this note we obtain and discuss formulae for the number of partial one-one transformations (of an n-element set) of height (equivalently, width) r and having exactly k fixed points. Moreover, we consider a generalization of the 'Hat Problem' or 'Probleme des Rencontres'.