Multiple pattern avoidance with respect to fixed points and excedances

MaRDI QIDQ1883667zbMATH OpenFDO

Authors Sergi Elizalde

Publication date 13 October 2004

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0311211, https://eudml.org/doc/124145, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r51.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Dyck pathspattern-avoiding permutationspatternsstatistics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two statistics. Some cases are generalized to patterns of arbitrary length. For avoidance of one single pattern we give partial results. We also describe the distribution of these statistics in involutions avoiding any subset of patterns of length 3. The main technique is to use bijections between pattern-avoiding permutations and certain kinds of Dyck paths, in such a way that the statistics in permutations that we study correspond to statistics on Dyck paths that are easy to enumerate.

Recommendations

• On multi-avoidance of generalized patterns.
• Multi-avoidance of generalised patterns
• Strict bounds for pattern avoidance
• Strict bounds for pattern avoidance
• Generalized pattern avoidance with additional restrictions
• On pattern avoidance in matchings and involutions
• Avoiding a pair of patterns in multisets and compositions
• Algebraic and affine pattern avoidance
• Using homological duality in consecutive pattern avoidance
• Pattern avoidance over a hypergraph

Cited in

(25)

• Pattern avoidance in permutations: Linear and cyclic orders
• Equidistributions of Mahonian statistics over pattern avoiding permutations
• Catalan pairs: a relational-theoretic approach to Catalan numbers
• Crossings and nestings over some Motzkin objects and \(q\)-Motzkin numbers
• Pattern-restricted permutations composed of 3-cycles
• Asymptotics of the extremal excedance set statistic
• Distributions of mesh patterns of short lengths
• Unimodal permutations and almost-increasing cycles
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Catalan structures and Catalan pairs
• Inversion polynomials for 321-avoiding permutations
• Permutation patterns and statistics
• Asymptotic distribution of fixed points of pattern-avoiding involutions
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• Distributions of statistics over pattern-avoiding permutations
• Fixed points of 321-avoiding permutations
• Pattern avoiding meandric permutations
• Crossings over permutations avoiding some pairs of patterns of length three
• Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
• Enumerating two permutation classes by the number of cycles
• Fixed points and excedances in restricted permutations
• Pattern-avoiding stabilized-interval-free permutations
• Pattern-avoiding permutations and Brownian excursion. II: Fixed points
• Composition schemes: q-enumerations and phase transitions in Gibbs models
• Restricted permutations refined by number of crossings and nestings

This page was built for publication: Multiple pattern avoidance with respect to fixed points and excedances

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