Search

The generating functions for a large class of combinatorial problems involving theenumeration of permutations may be expressed as solutions to matrix Riccati equations. Weshow that the generating functions for the permutation problem in which the number ofinversions is also preserved form a system of matrix Riccati equations in which thedifferential operator is the Eulerian differential operator. We obtain the classical resultof MacMahon concerning permutations.