The solution of a conjecture of Stanley and Wilf for all layered patterns

被引：18

作者：

Bóna, M ^{[1
]}

机构：

[1] Univ Quebec, LACIM, Montreal, PQ H3C 3P8, Canada

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1999年 / 85卷 / 01期

关键词：

D O I：

10.1006/jcta.1998.2908

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Proving a conjecture of Wilf and Stanley in hitherto the most general case, we show that for any layered pattern q there is a constant c so that q is avoided by less than c(n) permutations of lenght n. This will imply the solution of this conjecture fur at least 2(k) patterns of length k, for any k. (C) 1999 Academic Press.

引用

页码：96 / 104

页数：9

共 12 条

[1]

BABSON E, UNPUB PERMUTATIONS 1

[2] Permutations avoiding certain patterns: The case of length 4 and some generalizations [J].