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 条
  • [41] The probability of avoiding consecutive patterns in the Mallows distribution
    Crane, Harry
    DeSalvo, Stephen
    Elizalde, Sergi
    RANDOM STRUCTURES & ALGORITHMS, 2018, 53 (03) : 417 - 447
  • [42] Quadrant marked mesh patterns in 123-avoiding permutations
    Qiu, Dun
    Remmel, Jeffrey
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 19 (02):
  • [43] Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns
    Claesson, A
    Mansour, T
    ARS COMBINATORIA, 2005, 77 : 17 - 31
  • [44] Enumerating permutations avoiding three Babson-Steingrimsson patterns
    Bernini, Antonio
    Ferrari, Luca
    Pinzani, Renzo
    ANNALS OF COMBINATORICS, 2005, 9 (02) : 137 - 162
  • [45] On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs
    Kitaev, Sergey
    Pyatkin, Artem
    ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01):
  • [46] Exhaustive generation for permutations avoiding (colored) regular sets of patterns
    Phan Thuan Do
    Thi Thu Huong Tran
    Vajnovszki, Vincent
    DISCRETE APPLIED MATHEMATICS, 2019, 268 : 44 - 53
  • [47] The Infinite limit of random permutations avoiding patterns of length three
    Pinsky, Ross G.
    COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (01): : 137 - 152
  • [48] Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three
    Toufik Mansour
    Aaron Robertson
    Annals of Combinatorics, 2002, 6 (3) : 407 - 418
  • [49] Almost avoiding permutations
    Brignall, Robert
    Ekhad, Shalosh B.
    Smith, Rebecca
    Vatter, Vincent
    DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6626 - 6631
  • [50] Shape avoiding permutations
    Adin, RM
    Roichman, Y
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2002, 97 (01) : 162 - 176
12345