Total occurrence statistics on restricted permutations

zbMATH Open1313.05017arXiv1305.3177MaRDI QIDQ2937643FDOQ2937643

Sergi Elizalde, Alexander Burstein

Publication date: 9 January 2015

Abstract: We study the total number of occurrences of several vincular (also called generalized) patterns and other statistics, such as the major index and the Denert statistic, on permutations avoiding a pattern of length 3, extending results of Bona (2010, 2012) and Homberger (2012). In particular, for 2-3-1-avoiding permutations, we find the total number of occurrences of any vincular pattern of length 3. In some cases the answer is given by simple expressions involving binomial coefficients. The tools we use are bijections with Dyck paths, generating functions, and block decompositions of permutations.

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

zbMATH Keywords

pattern avoidancevincular patternrestricted permutationpermutation statistictotal occurrence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cited In (6)

• Refining enumeration schemes to count according to permutation statistics
• Crossings over permutations avoiding some pairs of patterns of length three
• Pattern-restricted permutations composed of 3-cycles
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Equidistributions of Mahonian statistics over pattern avoiding permutations
• Counting pattern avoiding permutations by number of movable letters

This page was built for publication: Total occurrence statistics on restricted permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937643)