<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(h \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>h</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, and let <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\textbf{b} = (b_1,\dots ,b_h)\in \mathbb {Z}^h\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">b</mi> <mo>=</mo> <mrow> <mo stretchy="false">(</mo> <msub> <mi>b</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>b</mi> <mi>h</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mi>h</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> be a zero-sum vector with nonzero coordinates. For a set <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(A=\{a_1&lt;a_2&lt;\cdots \}\subseteq \mathbb {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>=</mo> <mo stretchy="false">{</mo> <msub> <mi>a</mi> <mn>1</mn> </msub> <mo>&lt;</mo> <msub> <mi>a</mi> <mn>2</mn> </msub> <mo>&lt;</mo> <mo>⋯</mo> <mo stretchy="false">}</mo> <mo>⊆</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(r_{A,\textbf{b}}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>r</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi mathvariant="bold">b</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of <i>h</i>-tuples <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\((x_1,\ldots ,x_h)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>h</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of pairwise distinct elements of <i>A</i> satisfying <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(b_1x_1+\cdots +b_hx_h=n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>b</mi> <mn>1</mn> </msub> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>b</mi> <mi>h</mi> </msub> <msub> <mi>x</mi> <mi>h</mi> </msub> <mo>=</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>. We study density restrictions on sets <i>A</i> for which these representation counts remain small, obtaining analogues of the classical density theorem for infinite Sidon sets. In the case <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\textbf{b} = (c_1,-c_1,\dots ,c_k,-c_k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">b</mi> <mo>=</mo> <mo stretchy="false">(</mo> <msub> <mi>c</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>-</mo> <msub> <mi>c</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>c</mi> <mi>k</mi> </msub> <mo>,</mo> <mo>-</mo> <msub> <mi>c</mi> <mi>k</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, we prove that if <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(A(x)/(x/\log x)^{1/2k}\rightarrow \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">/</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">/</mo> <mo>log</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mrow> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> <mi>k</mi> </mrow> </msup> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\rightarrow \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>x</mi> </mfrac> <msub> <mo>∑</mo> <mrow> <mo stretchy="false">|</mo> <mi>n</mi> <mo stretchy="false">|</mo> <mo>≤</mo> <mi>x</mi> </mrow> </msub> <msub> <mi>r</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi mathvariant="bold">b</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation>, whereas if <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(A(x)\gg x^{1/2k}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>≫</mo> <msup> <mi>x</mi> <mrow> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> <mi>k</mi> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\gg \log x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>x</mi> </mfrac> <msub> <mo>∑</mo> <mrow> <mo stretchy="false">|</mo> <mi>n</mi> <mo stretchy="false">|</mo> <mo>≤</mo> <mi>x</mi> </mrow> </msub> <msub> <mi>r</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi mathvariant="bold">b</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>≫</mo> <mo>log</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation>. This recovers Chen’s theorem on <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(B_{2k}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>k</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>-sequences. For general zero-sum vectors <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\textbf{b}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="bold">b</mi> </math></EquationSource> </InlineEquation>, we prove analogous bounds under gap conditions: if <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(a_{n+1}-a_n=o(n^{h-1}\log n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>a</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>-</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <mo>=</mo> <mi>o</mi> <mrow> <mo stretchy="false">(</mo> <msup> <mi>n</mi> <mrow> <mi>h</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>log</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\rightarrow \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>x</mi> </mfrac> <msub> <mo>∑</mo> <mrow> <mo stretchy="false">|</mo> <mi>n</mi> <mo stretchy="false">|</mo> <mo>≤</mo> <mi>x</mi> </mrow> </msub> <msub> <mi>r</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi mathvariant="bold">b</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation>, whereas if <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(a_{n+1}-a_n\ll n^{h-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>a</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>-</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <mo>≪</mo> <msup> <mi>n</mi> <mrow> <mi>h</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\gg \log x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>x</mi> </mfrac> <msub> <mo>∑</mo> <mrow> <mo stretchy="false">|</mo> <mi>n</mi> <mo stretchy="false">|</mo> <mo>≤</mo> <mi>x</mi> </mrow> </msub> <msub> <mi>r</mi> <mrow> <mi>A</mi> <mo>,</mo> <mi mathvariant="bold">b</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mo>≫</mo> <mo>log</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Infinite Sidon-type sets for zero-sum linear forms

  • Christian Táfula

摘要

Let \(h \ge 2\) h 2 , and let \(\textbf{b} = (b_1,\dots ,b_h)\in \mathbb {Z}^h\) b = ( b 1 , , b h ) Z h be a zero-sum vector with nonzero coordinates. For a set \(A=\{a_1<a_2<\cdots \}\subseteq \mathbb {N}\) A = { a 1 < a 2 < } N , let \(r_{A,\textbf{b}}(n)\) r A , b ( n ) denote the number of h-tuples \((x_1,\ldots ,x_h)\) ( x 1 , , x h ) of pairwise distinct elements of A satisfying \(b_1x_1+\cdots +b_hx_h=n\) b 1 x 1 + + b h x h = n . We study density restrictions on sets A for which these representation counts remain small, obtaining analogues of the classical density theorem for infinite Sidon sets. In the case \(\textbf{b} = (c_1,-c_1,\dots ,c_k,-c_k)\) b = ( c 1 , - c 1 , , c k , - c k ) , we prove that if \(A(x)/(x/\log x)^{1/2k}\rightarrow \infty \) A ( x ) / ( x / log x ) 1 / 2 k , then \(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\rightarrow \infty \) 1 x | n | x r A , b ( n ) , whereas if \(A(x)\gg x^{1/2k}\) A ( x ) x 1 / 2 k , then \(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\gg \log x\) 1 x | n | x r A , b ( n ) log x . This recovers Chen’s theorem on \(B_{2k}\) B 2 k -sequences. For general zero-sum vectors \(\textbf{b}\) b , we prove analogous bounds under gap conditions: if \(a_{n+1}-a_n=o(n^{h-1}\log n)\) a n + 1 - a n = o ( n h - 1 log n ) , then \(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\rightarrow \infty \) 1 x | n | x r A , b ( n ) , whereas if \(a_{n+1}-a_n\ll n^{h-1}\) a n + 1 - a n n h - 1 , then \(\frac{1}{x}\sum _{|n|\le x} r_{A,\textbf{b}}(n)\gg \log x\) 1 x | n | x r A , b ( n ) log x .