Classification of bijections between 321- and 132-avoiding permutations
From MaRDI portal
Publication:2654626
zbMath1179.05006arXiv0805.1325MaRDI QIDQ2654626
Anders Claesson, Sergey Kitaev
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.1325
Related Items (25)
A combinatorial bijection on di-sk trees ⋮ Major index distribution over permutation classes ⋮ The Catalan combinatorics of the hereditary artin algebras ⋮ Impulse parameter and a new equivalence between 123- and 132-avoiding permutations ⋮ Harmonic numbers, Catalan's triangle and mesh patterns ⋮ The shape of random pattern-avoiding permutations ⋮ Polyurethane toggles ⋮ Inversion formulae on permutations avoiding 321 ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Further refinements of Wilf-equivalence for patterns of length 4 ⋮ Repetition in reduced decompositions ⋮ Permutations and pairs of Dyck paths ⋮ Pattern avoiding permutations with a unique longest increasing subsequence ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ Number of cycles in the graph of 312-avoiding permutations ⋮ Universality of random permutations ⋮ Bijective proofs of recurrences involving two Schröder triangles ⋮ On a refinement of Wilf-equivalence for permutations ⋮ The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ The Schützenberger involution over Dyck paths ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\) ⋮ Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations ⋮ Almost avoiding permutations
This page was built for publication: Classification of bijections between 321- and 132-avoiding permutations
