<p>We provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="220_2025_5233_Article_IEq1.gif" Format="GIF" Height="24" Rendition="HTML" Resolution="72" Type="Linedraw" Width="32" /> </InlineMediaObject> <EquationSource Format="TEX">\({\widehat{G}}_{\mu ,\nu }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mover accent="true"> <mi>G</mi> <mo stretchy="true">^</mo> </mover> <mrow> <mi>μ</mi> <mo>,</mo> <mi>ν</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>, which we call <i>clique-independent</i> graphs, indexed by two compositions <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="220_2025_5233_Article_IEq2.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mu \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>μ</mi> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="220_2025_5233_Article_IEq3.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\nu \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ν</mi> </math></EquationSource> </InlineEquation>. Moreover, we define a <i>delay</i> statistic on these configurations, and we show that, together with the usual <i>level</i> statistic, it can be used to provide a new combinatorial interpretation of the celebrated <i>shuffle theorem</i> of Carlsson and Mellit. More precisely, we will see how to interpret the polynomials <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="220_2025_5233_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(\langle \nabla e_n, e_\mu h_\nu \rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mi mathvariant="normal">∇</mi> <msub> <mi>e</mi> <mi>n</mi> </msub> <mo>,</mo> <msub> <mi>e</mi> <mi>μ</mi> </msub> <msub> <mi>h</mi> <mi>ν</mi> </msub> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> in terms of these configurations.</p>

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

Shuffle Theorems and Sandpiles

  • Michele D’Adderio,
  • Mark Dukes,
  • Alessandro Iraci,
  • Alexander Lazar,
  • Yvan Le Borgne,
  • Anna Vanden Wyngaerd

摘要

We provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs \({\widehat{G}}_{\mu ,\nu }\) G ^ μ , ν , which we call clique-independent graphs, indexed by two compositions \(\mu \) μ and \(\nu \) ν . Moreover, we define a delay statistic on these configurations, and we show that, together with the usual level statistic, it can be used to provide a new combinatorial interpretation of the celebrated shuffle theorem of Carlsson and Mellit. More precisely, we will see how to interpret the polynomials \(\langle \nabla e_n, e_\mu h_\nu \rangle \) e n , e μ h ν in terms of these configurations.