Fibonacci numbers, ordered partitions, and transformations of a finite set

Author

T. G. Lavers

Status

Research Report 93-59;
To appear in: Australasian Journal of Combinatorics
December 1993

Abstract

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 obtained.

Key phrases

Fibonacci numbers. combinatorics. transformation semigroups.

Content

The paper is available in the following forms:

PostScript:: fib-part.ps.gz (33kB) or fib-part.ps (123kB)

To minimize network load, please choose the smaller gzipped .gz form if and only if your browser client supports it.

Sydney Mathematics and Statistics