Restricted Permutations Enumerated by Inversions

被引:0
|
作者
Franklin, Atli Fannar [1 ]
Claesson, Anders [1 ]
Bean, Christian [2 ]
Ulfarsson, Henning [3 ]
Pantone, Jay [4 ]
机构
[1] Univ Iceland, Dept Math, Reykjavik, Iceland
[2] Keele Univ, Sch Comp Sci & Math, Keele, England
[3] Reykjavik Univ, Dept Comp Sci, Reykjavik, Iceland
[4] Marquette Univ, Dept Math & Stat Sci, Milwaukee, WI USA
关键词
D O I
10.4204/EPTCS.403.20
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion and Schmidt [6], we investigate all combinations of permutation patterns of length at most 3.
引用
收藏
页数:208
相关论文
共 50 条