<p>Haglund, Morse, and Zabrocki introduced a family of creation operators of Hall-Littlewood polynomials, <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{C_{a}\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msub> <mi>C</mi> <mi>a</mi> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> for any <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(a\in \mathbb {Z}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> </mrow> </math></EquationSource> </InlineEquation>, in their compositional refinement of the shuffle (ex-)conjecture. For any <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(\alpha \vDash n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>⊨</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>, the combinatorial formula for <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\nabla C_{\alpha }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">∇</mi> <msub> <mi>C</mi> <mi>α</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> is a weighted sum of parking functions. These summations can be converted to a weighted sum of certain LLT polynomials. Thus, <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\nabla C_{\alpha }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">∇</mi> <msub> <mi>C</mi> <mi>α</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> is Schur positive since Grojnowski and Haiman proved that all LLT polynomials are Schur positive. In this paper, we obtain a recursion that implies the <i>C</i>-positivity of <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq8.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="79" /> </InlineMediaObject> <EquationSource Format="TEX">\((-1)^{k} m_{2^{k}1^{l}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> <msub> <mi>m</mi> <mrow> <msup> <mn>2</mn> <mi>k</mi> </msup> <msup> <mn>1</mn> <mi>l</mi> </msup> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>, and hence prove the Schur positivity of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="94" /> </InlineMediaObject> <EquationSource Format="TEX">\((-1)^{k}\nabla m_{2^{k}1^{l}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> <mi mathvariant="normal">∇</mi> <msub> <mi>m</mi> <mrow> <msup> <mn>2</mn> <mi>k</mi> </msup> <msup> <mn>1</mn> <mi>l</mi> </msup> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>. As a corollary, a parking function interpretation for <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1434_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="94" /> </InlineMediaObject> <EquationSource Format="TEX">\((-1)^{k}\nabla m_{2^{k}1^{l}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> <mi mathvariant="normal">∇</mi> <msub> <mi>m</mi> <mrow> <msup> <mn>2</mn> <mi>k</mi> </msup> <msup> <mn>1</mn> <mi>l</mi> </msup> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation> is obtained by using the compositional shuffle theorem of Carlsson and Mellit.</p>

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

A parking function interpretation for \((-1)^{k}\nabla m_{2^{k}1^{l}}\)

  • Menghao Qu,
  • Guoce Xin

摘要

Haglund, Morse, and Zabrocki introduced a family of creation operators of Hall-Littlewood polynomials, \(\{C_{a}\}\) { C a } for any \(a\in \mathbb {Z}\) a Z , in their compositional refinement of the shuffle (ex-)conjecture. For any \(\alpha \vDash n\) α n , the combinatorial formula for \(\nabla C_{\alpha }\) C α is a weighted sum of parking functions. These summations can be converted to a weighted sum of certain LLT polynomials. Thus, \(\nabla C_{\alpha }\) C α is Schur positive since Grojnowski and Haiman proved that all LLT polynomials are Schur positive. In this paper, we obtain a recursion that implies the C-positivity of \((-1)^{k} m_{2^{k}1^{l}}\) ( - 1 ) k m 2 k 1 l , and hence prove the Schur positivity of \((-1)^{k}\nabla m_{2^{k}1^{l}}\) ( - 1 ) k m 2 k 1 l . As a corollary, a parking function interpretation for \((-1)^{k}\nabla m_{2^{k}1^{l}}\) ( - 1 ) k m 2 k 1 l is obtained by using the compositional shuffle theorem of Carlsson and Mellit.