论文标题
用签名的左至左和挖出来计算乱扰
Counting derangements with signed right-to-left minima and excedances
论文作者
论文摘要
最近，Alexandersson和Getachew证明了一些用于列举偶然杂物的公式的多元概括。在本文中，我们首先将他们的工作与最近继续进行排列的部分联系，并确认其一些观察结果。我们的第二个主要结果是其多元身份的两种改进，清楚地解释了每个术语在其主要公式中的含义。 我们还探索了一些类型的排列的一些类似的公式。
Recently Alexandersson and Getachew proved some multivariate generalizations of a formula for enumerating signed excedances in derangements. In this paper we first relate their work to a recent continued fraction for permutations and confirm some of their observations. Our second main result is two refinements of their multivariate identities, which clearly explain the meaning of each term in their main formulas. We also explore some similar formulas for permutations of type B.
