<p>For integers <i>k</i> and <i>l</i> with <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(1\le k\le l\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>k</mi> <mo>≤</mo> <mi>l</mi> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(a_{k,l}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>a</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be the number of partitions of <i>n</i> where each part can appear with three colors such that parts divisible by <i>k</i> may take either the first or second color, parts divisible by <i>l</i> may take either the first or third color, and parts divisible by both <i>k</i> and <i>l</i> may take any of the three colors. We apply the result of Sussman to derive the asymptotic formulas for <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="71" /> </InlineMediaObject> <EquationSource Format="TEX">\(\log a_{1,p}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>log</mo> <msub> <mi>a</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>p</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(\log a_{p,p}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>log</mo> <msub> <mi>a</mi> <mrow> <mi>p</mi> <mo>,</mo> <mi>p</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> when <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(p\le 11\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≤</mo> <mn>11</mn> </mrow> </math></EquationSource> </InlineEquation> is a prime and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq6.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="71" /> </InlineMediaObject> <EquationSource Format="TEX">\(\log a_{p,r}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>log</mo> <msub> <mi>a</mi> <mrow> <mi>p</mi> <mo>,</mo> <mi>r</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> when <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_912_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="244" /> </InlineMediaObject> <EquationSource Format="TEX">\((p,r)\in \{(2,3),(2,5),(2,7),(3,5)\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mi>r</mi> <mo stretchy="false">)</mo> <mo>∈</mo> <mo stretchy="false">{</mo> <mo stretchy="false">(</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mo stretchy="false">(</mo> <mn>2</mn> <mo>,</mo> <mn>5</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mo stretchy="false">(</mo> <mn>2</mn> <mo>,</mo> <mn>7</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mo stretchy="false">(</mo> <mn>3</mn> <mo>,</mo> <mn>5</mn> <mo stretchy="false">)</mo> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Asymptotic formulas for some 3-color partitions

  • Russelle Guadalupe

摘要

For integers k and l with \(1\le k\le l\) 1 k l , let \(a_{k,l}(n)\) a k , l ( n ) be the number of partitions of n where each part can appear with three colors such that parts divisible by k may take either the first or second color, parts divisible by l may take either the first or third color, and parts divisible by both k and l may take any of the three colors. We apply the result of Sussman to derive the asymptotic formulas for \(\log a_{1,p}(n)\) log a 1 , p ( n ) and \(\log a_{p,p}(n)\) log a p , p ( n ) when \(p\le 11\) p 11 is a prime and \(\log a_{p,r}(n)\) log a p , r ( n ) when \((p,r)\in \{(2,3),(2,5),(2,7),(3,5)\}\) ( p , r ) { ( 2 , 3 ) , ( 2 , 5 ) , ( 2 , 7 ) , ( 3 , 5 ) } .