Fibonacci numbers, ordered partitions, and transformations of a finite set
T. G. Lavers
Research Report 93-59;
To appear in: Australasian Journal of Combinatorics
A method of representing transformations of a finite set pictorially is
described. These pictures of a function are used to count certain idempotent
transformations, and interesting formulae for the Fibonacci numbers are
Fibonacci numbers. combinatorics. transformation semigroups.
The paper is available in the following forms:
- fib-part.ps.gz (33kB) or
To minimize network load, please choose the smaller gzipped .gz form if
and only if your browser client supports it.
Sydney Mathematics and Statistics