Scholarlink

<p>In this note, we show that the number of parking functions of length <i>n</i> with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of [<i>n</i>].</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Parking functions with zero secondary dinv

  • 期刊论文

  • 发表日期：

    2025年9月11日

查看全文
  • Susanna Fishel,
  • Luis Pena

摘要

In this note, we show that the number of parking functions of length n with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of [n].