Restricted permutations refined by number of crossings and nestings

DOI10.1016/j.disc.2020.111950zbMath1443.05007arXiv1808.03764OpenAlexW3028254010MaRDI QIDQ776264

Paul M. Rakotomamonjy

Publication date: 8 July 2020

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

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

zbMATH Keywords

crossingsbijectionsWilf-equivalencerestricted permutationsnestings\(q\)-Catalan numbers

Mathematics Subject Classification ID

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

Related Items (2)

Crossings over permutations avoiding some pairs of patterns of length three ⋮ Crossings and nestings over some Motzkin objects and \(q\)-Motzkin numbers

Uses Software

• AARON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation patterns and statistics
• Bijections for refined restricted permutations
• Fixed points and excedances in restricted permutations
• Another look at bijections for pattern-avoiding permutations
• On bijections for pattern-avoiding permutations
• \(q,p\)-Catalan numbers
• Refined restricted permutations
• A simple and unusual bijection for Dyck paths and its consequences
• Restricted permutations from Catalan to Fine and back
• Multiple pattern avoidance with respect to fixed points and excedances
• Crossings and alignments of permutations
• On Two Bijections from S_n(321) to S_n(132)
• On k-crossings and k-nestings of permutations
• Restricted permutations
• Permutations with restricted patterns and Dyck paths
• Continued fractions, \(q\)-Catalan numbers, and \(q\)-Genocchi polynomials

This page was built for publication: Restricted permutations refined by number of crossings and nestings