Avoiding consecutive patterns in permutations

被引：6
|
作者：
Aldred, R. E. L. [2 ]
Atkinson, M. D. [1 ]
McCaughan, D. J. [2 ]
机构：
[1] Univ Otago, Dept Comp Sci, Dunedin 9054, New Zealand
[2] Univ Otago, Dept Math & Stat, Dunedin 9054, New Zealand
来源：
ADVANCES IN APPLIED MATHEMATICS | 2010年 / 45卷 / 03期
关键词：
Permutation; Consecutive pattern; Enumeration; GENERALIZED PATTERNS; AVOIDANCE;
D O I：
10.1016/j.aam.2010.03.005
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The number of permutations that do not contain, as a factor (subword), a given set of permutations Pi is studied. A new treatment of the case Pi = {12...k} is given and then some numerical data is presented for sets Pi consisting of permutations of length at most 4. Some large sets of Wilf-equivalent permutations are also given. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：449 / 461
页数：13
相关论文
共 50 条
12345