Abstract

We use the material of Parts I and II to obtain further results in sequence enumeration. These include the enumeration of sequences with respect to both maximal π1 and π2‐paths, and the enumeration of sequences with distinguished substrings. We use the material to derive an enumerative proof of a generalization of a result of Foata and Schützenberger. Finally, we reconsider the enumeration of permutations with periodic pattern and show that the required generating function may be exhibited as the solution of a set of first‐order nonlinear differential equations. Subsequent work has shown these to be matrix Riccati equations, although we refer to them here as Volterra equations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.