On a refinement of Wilf-equivalence for permutations (Q2256116)

Summary: Recently, \textit{T. Dokos} et al. [Discrete Math. 312, No. 18, 2760--2775 (2012; Zbl 1248.05004)] conjectured that for all \(k, m\geqslant 1\), the patterns \( 12 \ldots k(k+m+1)\ldots (k+2)(k+1) \) and \((m+1)(m+2)\ldots(k+m+1)m\ldots 21\) are \(maj\)-Wilf-equivalent. In this paper, we confirm this conjecture for all \(k\geqslant 1\) and \(m=1\). In fact, we construct a descent set preserving bijection between \( 12\ldots k (k-1) \)-avoiding permutations and \(23\ldots k1\)-avoiding permutations for all \(k\geqslant 3\). As a corollary, our bijection enables us to settle a conjecture of \textit{N. Gowravaram} and \textit{R. Jagadeesan} [ibid. 20, No. 4, Research Paper P17, 28 p. (2013; Zbl 1300.05319)] concerning the Wilf-equivalence for permutations with given descent sets.