<p>For any positive integer <i>m</i>, let ℤ<sub><i>m</i></sub> be the additive group of residue classes modulo <i>m</i>. For <i>A</i> ⊆ ℤ<sub><i>m</i></sub> and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{n}\in\mathbb{Z}_{m}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo>∈</mo> <msub> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>, let the representation function <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{A}(\overline{n})\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msub> <mi>R</mi> <mrow> <mi>A</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> </math></EquationSource> </InlineEquation> denote the number of solutions of the equation <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq3.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="76" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{n}=\overline{a}+\overline{a^{\prime}}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo>=</mo> <mover> <mi>a</mi> <mo accent="false">¯</mo> </mover> <mo>+</mo> <mover> <msup> <mi>a</mi> <mrow> <mi class="MJX-variant" mathvariant="normal">′</mi> </mrow> </msup> <mo accent="false">¯</mo> </mover> </math></EquationSource> </InlineEquation> with unordered pairs <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\((\overline{a},\overline{a^{\prime}})\in A\times A\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mo stretchy="false">(</mo> <mover> <mi>a</mi> <mo accent="false">¯</mo> </mover> <mo>,</mo> <mover> <msup> <mi>a</mi> <mrow> <mi class="MJX-variant" mathvariant="normal">′</mi> </mrow> </msup> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> <mo>∈</mo> <mi>A</mi> <mo>×</mo> <mi>A</mi> </math></EquationSource> </InlineEquation>. Let <i>m</i> = 2<sup><i>α</i></sup><i>M</i> &gt; 2, where <i>α</i> is a positive integer and <i>M</i> is a positive odd integer. In this paper, the author proves that if <i>M</i> ≥ 3, then there exist two distinct sets <i>A</i>, <i>B</i> ⊆ ℤ<sub><i>m</i></sub> with ∣<i>A</i> ∪ <i>B</i>∣ = <i>m</i> − 2, <i>A</i> ∩ <i>B</i> = ∅ and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq5.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="86" /> </InlineMediaObject> <EquationSource Format="TEX">\(B\ne{\overline{m}\over{2}}+A\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>B</mi> <mo>≠</mo> <mrow> <mfrac> <mover> <mi>m</mi> <mo accent="false">¯</mo> </mover> <mrow> <mn>2</mn> </mrow> </mfrac> </mrow> <mo>+</mo> <mi>A</mi> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{A}(\overline{n})=R_{B}(\overline{n})\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msub> <mi>R</mi> <mrow> <mi>A</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> <mo>=</mo> <msub> <mi>R</mi> <mrow> <mi>B</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> </math></EquationSource> </InlineEquation> for all <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq7.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{n}\in\mathbb{Z}_{m}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo>∈</mo> <msub> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>. The author also proves that if <i>M</i> = 1 and <i>A</i>, <i>B</i> ⊆ ℤ<sub><i>m</i></sub> with ∣<i>A</i> ∪ <i>B</i>∣ = <i>m</i> − 2 and <i>A</i> ∩ <i>B</i> = ∅, then <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="113" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{A}(\overline{n})=R_{B}(\overline{n})\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msub> <mi>R</mi> <mrow> <mi>A</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> <mo>=</mo> <msub> <mi>R</mi> <mrow> <mi>B</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo stretchy="false">)</mo> </math></EquationSource> </InlineEquation> for all <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(\overline{n}\in\mathbb{Z}_{m}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mover> <mi>n</mi> <mo accent="false">¯</mo> </mover> <mo>∈</mo> <msub> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> if and only if <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11401_2025_12_Article_IEq10.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="86" /> </InlineMediaObject> <EquationSource Format="TEX">\(B={\overline{m}\over{2}}+A\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>B</mi> <mo>=</mo> <mrow> <mfrac> <mover> <mi>m</mi> <mo accent="false">¯</mo> </mover> <mrow> <mn>2</mn> </mrow> </mfrac> </mrow> <mo>+</mo> <mi>A</mi> </math></EquationSource> </InlineEquation>.</p>

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

Representation Functions on the Additive Group of Residue Classes

  • Cuifang Sun

摘要

For any positive integer m, let ℤm be the additive group of residue classes modulo m. For A ⊆ ℤm and \(\overline{n}\in\mathbb{Z}_{m}\) n ¯ Z m , let the representation function \(R_{A}(\overline{n})\) R A ( n ¯ ) denote the number of solutions of the equation \(\overline{n}=\overline{a}+\overline{a^{\prime}}\) n ¯ = a ¯ + a ¯ with unordered pairs \((\overline{a},\overline{a^{\prime}})\in A\times A\) ( a ¯ , a ¯ ) A × A . Let m = 2αM > 2, where α is a positive integer and M is a positive odd integer. In this paper, the author proves that if M ≥ 3, then there exist two distinct sets A, B ⊆ ℤm with ∣AB∣ = m − 2, AB = ∅ and \(B\ne{\overline{m}\over{2}}+A\) B m ¯ 2 + A such that \(R_{A}(\overline{n})=R_{B}(\overline{n})\) R A ( n ¯ ) = R B ( n ¯ ) for all \(\overline{n}\in\mathbb{Z}_{m}\) n ¯ Z m . The author also proves that if M = 1 and A, B ⊆ ℤm with ∣AB∣ = m − 2 and AB = ∅, then \(R_{A}(\overline{n})=R_{B}(\overline{n})\) R A ( n ¯ ) = R B ( n ¯ ) for all \(\overline{n}\in\mathbb{Z}_{m}\) n ¯ Z m if and only if \(B={\overline{m}\over{2}}+A\) B = m ¯ 2 + A .