Abstract
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'.
Original language | English |
---|---|
Pages (from-to) | 221-236 |
Number of pages | 16 |
Journal | Semigroup Forum |
Volume | 75 |
Issue number | 1 |
DOIs | |
Publication status | Published - Sept 2007 |
Externally published | Yes |
Keywords
- Derangement
- Exponential generating function
- Full transformation
- Laguerre polynomial
- Nilpotent
- Ordinary generating function
- Partial one-one transformation
- Partial transformation
- Permutation
- Semigroup
ASJC Scopus subject areas
- Algebra and Number Theory