Abstract

Based on two inversion formulas for enumerating words in the free monoid by adjacencies, we present a new approach to a class of permutation problems having Eulerian-type generating functions. We also show that a specialization of one of the inversion formulas gives Diekert's lifting to the free monoid of an inversion theorem due to Cartier and Foata.

Disciplines

Mathematics

Included in

Mathematics Commons

Share

COinS
 

URL: http://digitalcommons.calpoly.edu/math_fac/51