Permutation patterns and statistics

DOI10.1016/J.DISC.2012.05.014zbMath1248.05004arXiv1109.4976OpenAlexW2113209621WikidataQ56853330 ScholiaQ56853330MaRDI QIDQ449114

Bryan P. Johnson, Bruce E. Sagan, Tim Dwyer, Theodore Dokos, Kimberly Selsor

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4976

zbMATH Keywords

Catalan numbergenerating function\(q\)-analogueinversion numbermajor indexpattern avoidanceinteger partitionFibonacci numberWilf-equivalenceFoata bijectionMahonian pairpermutation statistic

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric groups (20B30)

Related Items (33)

Increasing spanning forests in graphs and simplicial complexes ⋮ Interview with Bruce Sagan ⋮ Major index distribution over permutation classes ⋮ Shuffle-compatible permutation statistics ⋮ Restricted growth function patterns and statistics ⋮ Set Partition Patterns and the Dimension Index ⋮ The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three ⋮ Unimodal permutations and almost-increasing cycles ⋮ Eulerian pairs on Fibonacci words ⋮ Inversion polynomials for 321-avoiding permutations ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ A sextuple equidistribution arising in pattern avoidance ⋮ Inversion formulae on permutations avoiding 321 ⋮ Equidistributions of Mahonian statistics over pattern avoiding permutations ⋮ Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns ⋮ Equidistribution of set-valued statistics on standard Young tableaux and transversals ⋮ Further refinements of Wilf-equivalence for patterns of length 4 ⋮ A refinement of Wilf-equivalence for patterns of length 4 ⋮ Descent sets on 321-avoiding involutions and hook decompositions of partitions ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ Mahonian pairs ⋮ On a refinement of Wilf-equivalence for permutations ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Crossings over permutations avoiding some pairs of patterns of length three ⋮ Pattern-avoiding polytopes ⋮ Refined Wilf-equivalences by Comtet statistics ⋮ Distributions of Statistics over Pattern-Avoiding Permutations ⋮ Restricted permutations refined by number of crossings and nestings ⋮ Cyclic pattern containment and avoidance ⋮ Inversion polynomials for permutations avoiding consecutive patterns ⋮ A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inversion polynomials for 321-avoiding permutations
• Bijections for refined restricted permutations
• Fixed points and excedances in restricted permutations
• A simple and unusual bijection for Dyck paths and its consequences
• Generalized permutation patterns and a classification of the Mahonian statistics
• Multiple pattern avoidance with respect to fixed points and excedances
• Generating trees and the Catalan and Schröder numbers
• Two element lattice permutation numbers and their \(q\)-generalization
• Congruences for Catalan and Motzkin numbers and related sequences
• Set partition statistics and \(q\)-Fibonacci numbers
• A relationship between the major index for tableaux and the charge statistic for permutations
• On the Netto Inversion Number of a Sequence
• Restricted permutations

This page was built for publication: Permutation patterns and statistics