A Logarithmic Connection for Circular Permutation Enumeration

A general theorem is obtained for the enumeration of permutations equivalent under cyclic rotation. This result gives the generating function as the logarithm of a determinant which arises in the enumeration of a related linear permutation enumeration. Applications of this theorem are given to a number of classical enumerative problems.