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

被引：46

作者：

Noonan, J

Zeilberger, D

机构：

[1] Department of Mathematics, Temple University, Philadelphia

来源：

ADVANCES IN APPLIED MATHEMATICS | 1996年 / 17卷 / 04期

关键词：

D O I：

10.1006/aama.1996.0016

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.'' (C) 1996 Academic Press, Inc.

引用

页码：381 / 407

页数：27

共 8 条

[1]

ERIKSON K, 1995, ELECTRON J COMBIN, V1, pR6

[2]

HOGGATT VE, 1976, FIBONACCI QUART, V14, P395

[3]

Knuth D. E., 1973, The Art of Computer Programming Volume 3, Sorting and Searching, VIII

[4]

NOONAN J, IN PRESS DISCRETE MA

[5]

SALVY B, 1994, ACM T MATH SOFTWARE, V20

[6]

Simion R., 1985, European J. Combin., V6, P383, DOI 10.1016/S0195-6698(85)80052-4

[7]

West J., 1990, THESIS MIT

[8] A HOLONOMIC SYSTEMS-APPROACH TO SPECIAL-FUNCTIONS IDENTITIES [J].

ZEILBERGER, D .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1990, 32 (03) :321-368

← 1 →