Cyclic subsemigroups of symmetric inverse semigroups

A generalization of the cycle notation for permutations is introduced for partial one-one transformations (charts). Notational representation theorems for charts that generalize those of permutations are given. Notational multiplication of charts is developed and then applied to yield a transparent proof of Frobenius' result which bounds the idempotent in the cyclic subsemigroup. Lastly, the well known result that the structure of the cyclic subgroups of the finite symmetric groups is determined from combinations of disjoint cycles is generalized to the cyclic subsemigroups of the finite symmetric inverse semigroups.