Publication:4584061
From MaRDI portal
zbMath1393.05010MaRDI QIDQ4584061
Anders Claesson, Sergey Kitaev
Publication date: 29 August 2018
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAJ0143
Related Items
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths, Rationality for subclasses of 321-avoiding permutations, Equidistributions of Mahonian statistics over pattern avoiding permutations, A natural bijection for contiguous pattern avoidance in words, A refinement of Wilf-equivalence for patterns of length 4, $k$-Arrangements, Statistics, and Patterns, An infinite family of inv-Wilf-equivalent permutation pairs, Avoiding patterns and making the best choice, On pattern avoiding indecomposable permutations, Refined Wilf-equivalences by Comtet statistics, Counting pattern avoiding permutations by number of movable letters, Restricted permutations refined by number of crossings and nestings, Combinatorial generation via permutation languages. I. Fundamentals