<p>Let <i>A</i> be a subset of positive integers. For a given positive integer <i>n</i> and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(0 \le i \le n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_{A}(i, n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>c</mi> <mi>A</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of <i>A</i>-compositions of <i>n</i> with exactly <i>i</i> parts. In this note, we investigate the sign behaviour of the sequence <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\((S_{A, k}(n))_{n \in \mathbb {N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>S</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq4.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="218" /> </InlineMediaObject> <EquationSource Format="TEX">\(S_{A, k}(n) = \sum _{i=0}^{n} (-1)^{k} i^{k} c_{A}(i, n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>S</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msubsup> <mo>∑</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>n</mi> </msubsup> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> <msup> <mi>i</mi> <mi>k</mi> </msup> <msub> <mi>c</mi> <mi>A</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. We prove that for a broad class of subsets <i>A</i>, the number <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="94" /> </InlineMediaObject> <EquationSource Format="TEX">\((-1)^{n} S_{A, k}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>n</mi> </msup> <msub> <mi>S</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is non-negative for all sufficiently large <i>n</i>. Moreover, we show that there exists <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(A \subset \mathbb {N}_{+}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>⊂</mo> <msub> <mi mathvariant="double-struck">N</mi> <mo>+</mo> </msub> </mrow> </math></EquationSource> </InlineEquation> such that the sign behaviour of <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1006_Article_IEq7.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="53" /> </InlineMediaObject> <EquationSource Format="TEX">\(S_{A, k}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>S</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is not periodic.</p>

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

Signs behaviour of sums of weighted numbers of compositions

  • Filip Gawron,
  • Maciej Ulas

摘要

Let A be a subset of positive integers. For a given positive integer n and \(0 \le i \le n\) 0 i n , let \(c_{A}(i, n)\) c A ( i , n ) denote the number of A-compositions of n with exactly i parts. In this note, we investigate the sign behaviour of the sequence \((S_{A, k}(n))_{n \in \mathbb {N}}\) ( S A , k ( n ) ) n N , where \(S_{A, k}(n) = \sum _{i=0}^{n} (-1)^{k} i^{k} c_{A}(i, n)\) S A , k ( n ) = i = 0 n ( - 1 ) k i k c A ( i , n ) . We prove that for a broad class of subsets A, the number \((-1)^{n} S_{A, k}(n)\) ( - 1 ) n S A , k ( n ) is non-negative for all sufficiently large n. Moreover, we show that there exists \(A \subset \mathbb {N}_{+}\) A N + such that the sign behaviour of \(S_{A, k}(n)\) S A , k ( n ) is not periodic.