Restricted permutations refined by number of crossings and nestings

DOI10.1016/J.DISC.2020.111950zbMATH Open1443.05007arXiv1808.03764OpenAlexW3028254010MaRDI QIDQ776264FDOQ776264

Authors: Paul M. Rakotomamonjy 

Publication date: 8 July 2020

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

Abstract: Let $st=s{t}_1,ldots,s{t}_k$ be a set of $k$ statistics on permutations with $kgeq1$. We say that two given subset of permutations $T$ and $T^{\prime }$ are $st$-Wilf-equivalent if the joint distributions of all statistics in $st$ over the sets of $T$-avoiding permutations $S_n(T)$ and $T^{\prime }$-avoiding permutations $S_n(T^{\prime })$ are the same. The main purpose of this paper is the (cr,nes)-Wilf-equivalence classes for all single patterns in $S_3$, where cr and nes denote respectively the statistics number of crossings and nestings. One of the main tools that we use is the bijection $Theta:S_n(321)ightarrow{S}_n(132)$ which was originally exhibited by Elizalde and Pak in cite{ElizP}. They proved that the bijection $Theta$ preserves the number of fixed points and excedances. Since the given formulation of $Theta$ is not direct, we show that it can be defined directly by a recursive formula. Then, we prove that it also preserves the number of crossings. Due to the fact that the sets of non-nesting permutations and 321-avoiding permutations are the same, these properties of the bijection $Theta$ leads to an unexpected result related to the q,p-Catalan numbers of Randrianarivony defined in cite{ARandr}.

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

Recommendations

• On k-crossings and k-nestings of permutations
• Bijections for refined restricted permutations
• On bijections for pattern-avoiding permutations
• On two bijections from \(S_{n}(321)\) to \(S_{n}(132)\).
• Crossings over permutations avoiding some pairs of patterns of length three

zbMATH Keywords

bijectionsrestricted permutationsWilf-equivalencecrossingsnestings\(q\)-Catalan numbers

Mathematics Subject Classification ID

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

Cites Work

• Refined restricted permutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted permutations
• Bijections for refined restricted permutations
• Permutations with restricted patterns and Dyck paths
• A simple and unusual bijection for Dyck paths and its consequences
• On bijections for pattern-avoiding permutations
• Permutation patterns and statistics
• Fixed points and excedances in restricted permutations
• Another look at bijections for pattern-avoiding permutations
• Crossings and alignments of permutations
• On k-crossings and k-nestings of permutations
• Multiple pattern avoidance with respect to fixed points and excedances
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted permutations from Catalan to Fine and back
• On two bijections from \(S_{n}(321)\) to \(S_{n}(132)\).
• \(q,p\)-Catalan numbers
• Continued fractions, \(q\)-Catalan numbers, and \(q\)-Genocchi polynomials

Cited In (3)

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

Uses Software

• AARON

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

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