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 | |
| State | Published - Sep 2007 |
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
Fingerprint
Dive into the research topics of 'Combinatorial results for the symmetric inverse semigroup'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver