已收录 272666 条政策
 政策提纲
  • 暂无提纲
On a Refinement ofWilf-equivalence for Permutations
[摘要] Recently, Dokos et al. conjectured that for all $k, m\geq 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\geq 1$ and $m=1$. I
[发布日期]  [发布机构] 
[效力级别]  [学科分类] 离散数学和组合数学
[关键词]  [时效性] 
   浏览次数:1      统一登录查看全文      激活码登录查看全文