Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
From MaRDI portal
Publication:540135
zbMath1220.05003arXiv1102.4226MaRDI QIDQ540135
Anders Claesson, Petter Brändén
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4226
permutation statisticsdescentsmajor indexexcedancespermutation patternsimsun permutationsmesh patternsleft-to-right maximaAndre permutationsMahonian staticticsstrong fixed points
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (42)
The peak statistics on simsun permutations ⋮ An a priori harmonic mesh for singularly perturbed boundary value problems ⋮ Transformation à la Foata for special kinds of descents and excedances ⋮ Word-Representable Graphs: a Survey ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ \(k\)-pop stack sortable permutations and \(2\)-avoidance ⋮ Principal specializations of Schubert polynomials and pattern containment ⋮ The poset of mesh patterns ⋮ Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem ⋮ Harmonic numbers, Catalan's triangle and mesh patterns ⋮ Shape-Wilf-equivalences for vincular patterns ⋮ Wilf-classification of mesh patterns of short length ⋮ Algorithmic coincidence classification of mesh patterns ⋮ Positional Marked Patterns in Permutations ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Singleton mesh patterns in multidimensional permutations ⋮ About half permutations ⋮ Equidistributions of mesh patterns of length two ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Counting permutations by simsun successions ⋮ Sorting with pattern-avoiding stacks: the \(132\)-machine ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ Turning cycle restrictions into mesh patterns via Foata's fundamental transformation ⋮ An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem ⋮ Stack-sorting preimages of permutation classes ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ Unnamed Item ⋮ Restricted non-separable planar maps and some pattern avoiding permutations ⋮ Noncontiguous pattern containment in binary trees ⋮ Reduced word manipulation: patterns and enumeration ⋮ Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures ⋮ Distributions of several infinite families of mesh patterns ⋮ Mesh patterns with superfluous mesh ⋮ Distributions of mesh patterns of short lengths ⋮ Frame patterns in \(n\)-cycles ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ \((a, b)\)-rectangle patterns in permutations and words ⋮ Transport of patterns by Burge transpose ⋮ Weak ascent sequences and related combinatorial structures ⋮ From Hertzsprung's problem to pattern-rewriting systems ⋮ Pattern-functions, statistics, and shallow permutations ⋮ Asymptotic behaviour of the containment of certain mesh patterns
This page was built for publication: Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
