The enumeration of permutations with a prescribed number of "forbidden" patterns

John Noonan, Doron Zeilberger

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

We 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."

Original languageEnglish (US)
Pages (from-to)381-407
Number of pages27
JournalAdvances in Applied Mathematics
Volume17
Issue number4
DOIs
StatePublished - Dec 1996

Fingerprint

Enumeration
Permutation

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Cite this

@article{eae2f90be8224be580c6ba10cf27d8c6,
title = "The enumeration of permutations with a prescribed number of {"}forbidden{"} patterns",
abstract = "We 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.{"}",
author = "John Noonan and Doron Zeilberger",
year = "1996",
month = "12",
doi = "10.1006/aama.1996.0016",
language = "English (US)",
volume = "17",
pages = "381--407",
journal = "Advances in Applied Mathematics",
issn = "0196-8858",
publisher = "Academic Press Inc.",
number = "4",

}

The enumeration of permutations with a prescribed number of "forbidden" patterns. / Noonan, John; Zeilberger, Doron.

In: Advances in Applied Mathematics, Vol. 17, No. 4, 12.1996, p. 381-407.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The enumeration of permutations with a prescribed number of "forbidden" patterns

AU - Noonan, John

AU - Zeilberger, Doron

PY - 1996/12

Y1 - 1996/12

N2 - We 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."

AB - We 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."

UR - http://www.scopus.com/inward/record.url?scp=0030527058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030527058&partnerID=8YFLogxK

U2 - 10.1006/aama.1996.0016

DO - 10.1006/aama.1996.0016

M3 - Article

AN - SCOPUS:0030527058

VL - 17

SP - 381

EP - 407

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

SN - 0196-8858

IS - 4

ER -