On a refinement of Wilf-equivalence for permutations

MaRDI QIDQ2256116zbMATH OpenFDO

Authors Sherry H. F. Yan, Huiyun Ge, Yaqiu Zhang

Publication date 19 February 2015

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

Full work available at URL https://arxiv.org/abs/1410.2933, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p20

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

\(maj\)-Wilf equivalentbijectionpattern avoiding permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Symmetric groups (20B30)

Abstract: Recently, Dokos et al. conjectured that for all $k,mgeq1$, the patterns $12ldotsk(k+m+1)ldots(k+2)(k+1)$ and $(m+1)(m+2)ldots(k+m+1)mldots21$ are $maj$-Wilf-equivalent. In this paper, we confirm this conjecture for all $kgeq1$ and $m=1$. In fact, we construct a descent set preserving bijection between $12ldotsk(k-1)$-avoiding permutations and $23ldotsk1$-avoiding permutations for all $kgeq3$. As a corollary, our bijection enables us to settle a conjecture of Gowravaram and Jagadeesan concerning the Wilf-equivalence for permutations with given descent sets.

Review text

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.

Recommendations

• On Wilf equivalence for alternating permutations
• A new class of Wilf-equivalent permutations
• On super-strong Wilf equivalence classes of permutations
• Fine and Wilf's theorem for permutations
• On refinements of Wilf-equivalence for involutions
• Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
• scientific article; zbMATH DE number 4192313
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• An infinite family of inv-Wilf-equivalent permutation pairs
• A generalization of \(\sigma\)-permutability

Cites work

• A refinement of Wilf-equivalence for patterns of length 4
• Another look at bijections for pattern-avoiding permutations
• Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
• Classification of bijections between 321- and 132-avoiding permutations
• Fixed points and excedances in restricted permutations
• Generating trees and pattern avoidance in alternating permutations
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• On a family of conjectures of Joel Lewis on alternating permutations
• On bijections for pattern-avoiding permutations
• Patterns in permutations and words.
• Permutation patterns and statistics
• Refined restricted involutions
• Refined restricted permutations
• Wilf-equivalence for singleton classes

Cited in

(11)

• A new class of Wilf-equivalent permutations
• Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns
• A refinement of Wilf-equivalence for patterns of length 4
• Major index distribution over permutation classes
• Permutation patterns and statistics
• On comparability of bigrassmannian permutations
• Major index over descent for pattern-avoiding permutations
• Operators of equivalent sorting power and related Wilf-equivalences
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Further refinements of Wilf-equivalence for patterns of length 4
• Fine and Wilf's theorem for permutations

This page was built for publication: On a refinement of Wilf-equivalence for permutations

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