AI 中文总结
在装饰排列背景下，不使用q-二项式反演公式，直接给出Gessel–Reutenauer–Wachs公式的组合证明，核心基于带固定数量符号不动点的装饰排列的主指标生成函数及对合，回答了Chen的问题。
AI 中文摘要
本笔记旨在通过装饰排列对q-错排数的Gessel–Reutenauer–Wachs公式提供直接组合证明，不使用q-二项式反演公式。Postnikov引入的装饰排列为Chen的带符号不动点模型提供自然框架。证明基于带固定数量符号不动点的装饰排列的主指标生成函数及符号反转且保持下降集的对合，回答了Chen提出的问题。此对合通过人机协作发现。
英文摘要
This paper aims to provide a direct combinatorial proof of the Gessel-Wachs formula for $q$-derangement numbers in the setting of decorated permutations, without using the $q$-binomial inversion formula. Decorated permutations, introduced by Postnikov in his study of the totally nonnegative Grassmannian, provide a natural framework for Chen's signed fixed-point model. Our proof is based on a major-index generating function for decorated permutations with a fixed number of signed fixed points, together with a sign-reversing and descent-set-preserving involution, thereby answering a question raised by Chen. This involution was discovered through human--AI collaboration. Moreover, our framework yields an immediate proof of a result of Désarménien and Wachs concerning the equidistribution between descent classes of derangements and descent classes of desarrangements. We also supply combinatorial proofs of two recurrence relations for the $q$-derangement numbers in the setting of desarrangements with the aid of the insertion lemma for ordinary permutations.
Comments15 pages
