<p>The generating polynomial of all <i>n</i>-permutations with respect to the number of alternating runs possesses a root at <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> of multiplicity <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\lfloor (n-2)/2 \rfloor \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⌊</mo> <mo stretchy="false">(</mo> <mi>n</mi> <mo>-</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> <mo>⌋</mo> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(n \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. This fact can be deduced by combining the David–Barton formula for Eulerian polynomials with the Foata–Schützenberger <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>γ</mi> </math></EquationSource> </InlineEquation>-decomposition of these polynomials. Recently, Bóna provided a group—action proof of this result. In the present paper, we propose an alternative approach based on the Hetyei–Reiner action on binary trees, which yields a new combinatorial interpretation of Bóna’s quotient polynomial. Furthermore, we extend our study to analogous results for permutations of types&#xa0;B and&#xa0;D. As a consequence of our bijective framework, we also obtain combinatorial proofs of David–Barton type identities for permutations of types&#xa0;A and&#xa0;B.</p>

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

Counting Permutations by Alternating Runs via Hetyei–Reiner Trees

  • Qiongqiong Pan,
  • Yunze Wang,
  • Jiang Zeng

摘要

The generating polynomial of all n-permutations with respect to the number of alternating runs possesses a root at \(-1\) - 1 of multiplicity \(\lfloor (n-2)/2 \rfloor \) ( n - 2 ) / 2 for \(n \ge 2\) n 2 . This fact can be deduced by combining the David–Barton formula for Eulerian polynomials with the Foata–Schützenberger \(\gamma \) γ -decomposition of these polynomials. Recently, Bóna provided a group—action proof of this result. In the present paper, we propose an alternative approach based on the Hetyei–Reiner action on binary trees, which yields a new combinatorial interpretation of Bóna’s quotient polynomial. Furthermore, we extend our study to analogous results for permutations of types B and D. As a consequence of our bijective framework, we also obtain combinatorial proofs of David–Barton type identities for permutations of types A and B.