Permutations avoiding certain patterns: The case of length 4 and some generalizations

被引：32
|
作者：
Bona, M [1 ]
机构：
[1] MIT,DEPT MATH,CAMBRIDGE,MA 02139
来源：
DISCRETE MATHEMATICS | 1997年 / 175卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(96)00140-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Proving and disproving some earlier conjectures, we give a characterization of the numbers of permutations avoiding each pattern of length 4. Some implications for longer patterns are included.
引用
收藏
页码：55 / 67
页数：13
相关论文
共 50 条
  • [21] The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three
    Do, Phan Thuan
    Tran, Thi Thu Huong
    Vajnovszki, Vincent
    DISCRETE MATHEMATICS, 2022, 345 (02)
  • [22] Symmetric Permutations Avoiding Two Patterns
    Lonoff, David
    Ostroff, Jonah
    ANNALS OF COMBINATORICS, 2010, 14 (01) : 143 - 158
  • [23] Partial permutations avoiding pairs of patterns
    Arbesfeld, Noah
    DISCRETE MATHEMATICS, 2013, 313 (22) : 2614 - 2625
  • [24] Permutations avoiding consecutive patterns, II
    Warlimont, R
    ARCHIV DER MATHEMATIK, 2005, 84 (06) : 496 - 502
  • [25] Symmetric Permutations Avoiding Two Patterns
    David Lonoff
    Jonah Ostroff
    Annals of Combinatorics, 2010, 14 : 143 - 158
  • [26] Permutations avoiding consecutive patterns, II
    Richard Warlimont
    Archiv der Mathematik, 2005, 84 : 496 - 502
  • [27] On partially ordered patterns of length 4 and 5 in permutations
    Gao, Alice L. L.
    Kitaev, Sergey
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (03):
  • [28] Algorithms for testing occurrences of length 4 patterns in permutations
    Han, Yijie
    Saxena, Sanjeev
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 189 - 208
  • [29] Algorithms for testing occurrences of length 4 patterns in permutations
    Yijie Han
    Sanjeev Saxena
    Journal of Combinatorial Optimization, 2018, 35 : 189 - 208
  • [30] Patterns in Random Permutations Avoiding the Pattern 132
    Janson, Svante
    COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (01): : 24 - 51
12345