<p>A nonnegative sequence of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{a_n\}_{n\ge 0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> satisfies the Briggs inequality if <Equation ID="Equ46"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_Equ46.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="297" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} a_n^2(a_n^2-a_{n-1}a_{n+1})&gt;a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msubsup> <mi>a</mi> <mi>n</mi> <mn>2</mn> </msubsup> <mrow> <mo stretchy="false">(</mo> <msubsup> <mi>a</mi> <mi>n</mi> <mn>2</mn> </msubsup> <mo>-</mo> <msub> <mi>a</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <msub> <mi>a</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">)</mo> </mrow> <mo>&gt;</mo> <msubsup> <mi>a</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <mrow> <mo stretchy="false">(</mo> <msubsup> <mi>a</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <mo>-</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <msub> <mi>a</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>holds for any <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. In this paper we show that both the partition function <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{p(n+N_0)\}_{n\ge 0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <mi>p</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> and the overpartition function <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="114" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{\overline{p}(n+\overline{N}_0)\}_{n\ge 0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mover> <mi>N</mi> <mo>¯</mo> </mover> <mn>0</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> satisfy the Briggs inequality for some <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>N</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{N}_{0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mover> <mi>N</mi> <mo>¯</mo> </mover> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation>. Based on Chern’s formula for <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq7.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\eta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>η</mi> </math></EquationSource> </InlineEquation>-quotients, we further prove that the <i>k</i>-regular partition function <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="120" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{p_k(n+N_{k})\}_{n\ge 0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mi>p</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> and the <i>k</i>-regular overpartition function <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq9.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="122" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{\overline{p}_k(n+\overline{N}_k)\}_{n\ge 0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mover> <mi>p</mi> <mo>¯</mo> </mover> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <msub> <mover> <mi>N</mi> <mo>¯</mo> </mover> <mi>k</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> also satisfy the Briggs inequality for <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq10.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(2\le k\le 9\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo>≤</mo> <mi>k</mi> <mo>≤</mo> <mn>9</mn> </mrow> </math></EquationSource> </InlineEquation> and some <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1103_Article_IEq11.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="53" /> </InlineMediaObject> <EquationSource Format="TEX">\(N_k,\overline{N}_{k}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo>,</mo> <msub> <mover> <mi>N</mi> <mo>¯</mo> </mover> <mi>k</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

The Briggs inequality for partitions and overpartitions

  • Xin-Bei Liu,
  • Zhong-Xue Zhang

摘要

A nonnegative sequence of \(\{a_n\}_{n\ge 0}\) { a n } n 0 satisfies the Briggs inequality if \(\begin{aligned} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{aligned}\) a n 2 ( a n 2 - a n - 1 a n + 1 ) > a n - 1 2 ( a n + 1 2 - a n a n + 2 ) holds for any \(n\ge 1\) n 1 . In this paper we show that both the partition function \(\{p(n+N_0)\}_{n\ge 0}\) { p ( n + N 0 ) } n 0 and the overpartition function \(\{\overline{p}(n+\overline{N}_0)\}_{n\ge 0}\) { p ¯ ( n + N ¯ 0 ) } n 0 satisfy the Briggs inequality for some \(N_0\) N 0 and \(\overline{N}_{0}\) N ¯ 0 . Based on Chern’s formula for \(\eta \) η -quotients, we further prove that the k-regular partition function \(\{p_k(n+N_{k})\}_{n\ge 0}\) { p k ( n + N k ) } n 0 and the k-regular overpartition function \(\{\overline{p}_k(n+\overline{N}_k)\}_{n\ge 0}\) { p ¯ k ( n + N ¯ k ) } n 0 also satisfy the Briggs inequality for \(2\le k\le 9\) 2 k 9 and some \(N_k,\overline{N}_{k}\) N k , N ¯ k .