ABSTRACT
Let S be a set. By a permutation of S, we mean a bijection from S to S — that is, a function from S to S that is both onto and 1-1. Permutations form a rather pleasant and useful class of functions, and we shall study various aspects of them in this chapter.
