<p>For a finite abelian group <i>G</i> and a positive integer <i>k</i>, let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\textsf{D}_k(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">D</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the smallest integer <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> such that each sequence over <i>G</i> of length at least <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> has <i>k</i> disjoint nontrivial zero-sum subsequences. It is known that <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="159" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathsf D_k(G)=n_1+kn_2-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">D</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>+</mo> <mi>k</mi> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> if <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="108" /> </InlineMediaObject> <EquationSource Format="TEX">\(G\cong C_{n_1}\oplus C_{n_2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≅</mo> <msub> <mi>C</mi> <msub> <mi>n</mi> <mn>1</mn> </msub> </msub> <mo>⊕</mo> <msub> <mi>C</mi> <msub> <mi>n</mi> <mn>2</mn> </msub> </msub> </mrow> </math></EquationSource> </InlineEquation> is a rank 2 group, where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="75" /> </InlineMediaObject> <EquationSource Format="TEX">\(1&lt;n_1\, | \,n_2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>&lt;</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> <mrow> <mspace width="0.166667em" /> <mo stretchy="false">|</mo> <mspace width="0.166667em" /> </mrow> <msub> <mi>n</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>. We investigate the associated inverse problem for rank 2 groups, that is, characterizing the structure of zero-sum sequences of length <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathsf D_k(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">D</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> that can not be partitioned into <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="493_2025_153_Article_IEq8.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(k+1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> nontrivial zero-sum subsequences.</p>

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

On the Inverse Problem of the k-th Davenport Constants for Groups of Rank 2

  • Qinghai Zhong

摘要

For a finite abelian group G and a positive integer k, let \(\textsf{D}_k(G)\) D k ( G ) denote the smallest integer \(\ell \) such that each sequence over G of length at least \(\ell \) has k disjoint nontrivial zero-sum subsequences. It is known that \(\mathsf D_k(G)=n_1+kn_2-1\) D k ( G ) = n 1 + k n 2 - 1 if \(G\cong C_{n_1}\oplus C_{n_2}\) G C n 1 C n 2 is a rank 2 group, where \(1<n_1\, | \,n_2\) 1 < n 1 | n 2 . We investigate the associated inverse problem for rank 2 groups, that is, characterizing the structure of zero-sum sequences of length \(\mathsf D_k(G)\) D k ( G ) that can not be partitioned into \(k+1\) k + 1 nontrivial zero-sum subsequences.