<p>We consider the number of various partitions of <i>n</i> with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1118_Article_IEq1.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> we have <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1118_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_{\text {od}}^{\text {eu}}(n)&lt;p_{\text {ed}}^{\text {ou}}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>p</mi> <mrow> <mtext>od</mtext> </mrow> <mtext>eu</mtext> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>&lt;</mo> <msubsup> <mi>p</mi> <mrow> <mtext>ed</mtext> </mrow> <mtext>ou</mtext> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1118_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_{\text {od}}^{\text {eu}}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>p</mi> <mrow> <mtext>od</mtext> </mrow> <mtext>eu</mtext> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is the number of partitions of <i>n</i> with odd parts distinct and even parts unrestricted and all odd parts less than all even parts and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1118_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_{\text {ed}}^{\text {ou}}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>p</mi> <mrow> <mtext>ed</mtext> </mrow> <mtext>ou</mtext> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is the number of partitions of <i>n</i> with even parts distinct and odd parts unrestricted and all even parts less than all odd parts. We also prove a conjectural inequality of Fu and Tang involving partitions with parts separated by parity with restrictions on the multiplicity of parts.</p>

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

Combinatorial proofs of inequalities involving the number of partitions with parts separated by parity

  • Cristina Ballantine,
  • Amanda Welch

摘要

We consider the number of various partitions of n with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for \(n\ge 5\) n 5 we have \(p_{\text {od}}^{\text {eu}}(n)<p_{\text {ed}}^{\text {ou}}(n)\) p od eu ( n ) < p ed ou ( n ) , where \(p_{\text {od}}^{\text {eu}}(n)\) p od eu ( n ) is the number of partitions of n with odd parts distinct and even parts unrestricted and all odd parts less than all even parts and \(p_{\text {ed}}^{\text {ou}}(n)\) p ed ou ( n ) is the number of partitions of n with even parts distinct and odd parts unrestricted and all even parts less than all odd parts. We also prove a conjectural inequality of Fu and Tang involving partitions with parts separated by parity with restrictions on the multiplicity of parts.