<p>A permutation is called <i>mod-k-alternating</i> if its entries are restricted to having the same remainder as the index, modulo some integer <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(k \ge 1.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>1</mn> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> In this paper, we find the sign-balance for mod-k-alternating permutations with respect to the statistic excedance. Moreover, we study the sign-balance for excedances over mod-k-alternating derangements. The results are obtained by constructing suitable matrices and connecting their determinants with the signed excedance enumeration of mod-k-alternating permutations. As an application of the signed excedance enumeration, we prove that when <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(n \equiv k \pmod {2k}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≡</mo> <mi>k</mi> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>2</mn> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, the excedance enumerating polynomials over the even and odd mod-k-alternating permutations, starting with a fixed remainder, are gamma-positive.</p>

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

Sign-balance of excedances over mod-k-alternating permutations and gamma-positivity

  • Hiranya Kishore Dey,
  • Iswar Mahato

摘要

A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer \(k \ge 1.\) k 1 . In this paper, we find the sign-balance for mod-k-alternating permutations with respect to the statistic excedance. Moreover, we study the sign-balance for excedances over mod-k-alternating derangements. The results are obtained by constructing suitable matrices and connecting their determinants with the signed excedance enumeration of mod-k-alternating permutations. As an application of the signed excedance enumeration, we prove that when \(n \equiv k \pmod {2k}\) n k ( mod 2 k ) , the excedance enumerating polynomials over the even and odd mod-k-alternating permutations, starting with a fixed remainder, are gamma-positive.