The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns

Simple item page
dc.creatorNoonan, John
dc.creatorZeilberger, Doron
dc.date1998-08-17
dc.date.accessioned2026-07-07T05:25:44Z
dc.date.available2026-07-07T05:25:44Z
dc.descriptionWe initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns `abc',`cab' and `abcd'.
dc.descriptionAMSTeX
dc.identifierhttps://arxiv.org/abs/math/9808080
dc.identifierhttp://arxiv.org/abs/math/9808080
dc.identifierAdvances in Applied Mathematics 17 (1996), 381-407
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77296
dc.subjectCombinatorics
dc.titleThe Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns
dc.typetext

Files

Collections

arXiv