<p>Let <i>G</i> be a finite abelian group and <i>p</i> be the smallest prime divisor of |<i>G</i>|. Let <i>S</i> be a sequence over <i>G</i>. We say that <i>S</i> is regular if <i>S</i> contains at most <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="TEX">\(|H|-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">|</mo> <mi>H</mi> <mo stretchy="false">|</mo> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> terms from <i>H</i> for every proper subgroup <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\(H \subsetneq G\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>H</mi> <mo>⊊</mo> <mi>G</mi> </mrow> </math></EquationSource> </InlineEquation>. Let <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(\textsf{c}_0(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">c</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be the smallest integer <i>t</i> such that every regular sequence <i>S</i> over <i>G</i> of length <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(|S|\ge t\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">|</mo> <mi>S</mi> <mo stretchy="false">|</mo> <mo>≥</mo> <mi>t</mi> </mrow> </math></EquationSource> </InlineEquation> forms an additive basis of <i>G</i>, i.e., <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="82" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sum (S)=G\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>∑</mo> <mo stretchy="false">(</mo> <mi>S</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>G</mi> </mrow> </math></EquationSource> </InlineEquation>. It was conjectured by Gao et al. [<CitationRef CitationID="CR2">2</CitationRef>] that <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="103" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textsf{c}}_0(G)=m(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">c</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>m</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. In this note, we confirm the conjecture for the case when <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="107" /> </InlineMediaObject> <EquationSource Format="TEX">\(G=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> with <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(n_1|n_2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>n</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(p\ge 11\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≥</mo> <mn>11</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(n_1\ge p^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>≥</mo> <msup> <mi>p</mi> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> and we also characterize the structure of regular sequences <i>S</i> over <i>G</i> of length <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq11.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="114" /> </InlineMediaObject> <EquationSource Format="TEX">\(|S|={\textsf{c}}_0(G)-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> <mi>S</mi> <mo stretchy="false">|</mo> </mrow> <mo>=</mo> <msub> <mi mathvariant="sans-serif">c</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2895_Article_IEq12.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="82" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sum (S)\ne G\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>∑</mo> <mo stretchy="false">(</mo> <mi>S</mi> <mo stretchy="false">)</mo> <mo>≠</mo> <mi>G</mi> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

A Note on Additive Bases of Abelian Groups of Rank 2

  • Yongke Qu,
  • Yuanlin Li,
  • Qinghong Wang,
  • Xiaoyue Zhao

摘要

Let G be a finite abelian group and p be the smallest prime divisor of |G|. Let S be a sequence over G. We say that S is regular if S contains at most \(|H|-1\) | H | - 1 terms from H for every proper subgroup \(H \subsetneq G\) H G . Let \(\textsf{c}_0(G)\) c 0 ( G ) be the smallest integer t such that every regular sequence S over G of length \(|S|\ge t\) | S | t forms an additive basis of G, i.e., \(\sum (S)=G\) ( S ) = G . It was conjectured by Gao et al. [2] that \({\textsf{c}}_0(G)=m(G)\) c 0 ( G ) = m ( G ) . In this note, we confirm the conjecture for the case when \(G=C_{n_1}\oplus C_{n_2}\) G = C n 1 C n 2 with \(n_1|n_2\) n 1 | n 2 , \(p\ge 11\) p 11 and \(n_1\ge p^2\) n 1 p 2 and we also characterize the structure of regular sequences S over G of length \(|S|={\textsf{c}}_0(G)-1\) | S | = c 0 ( G ) - 1 with \(\sum (S)\ne G\) ( S ) G .