<p>In this paper, we study oscillations problem according to the Hecke eigenvalues for Maass cusp forms with Fourier coefficients <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\lambda _{f}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>λ</mi> <mi>f</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in exponential sums. For Möbius function <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mu (n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>μ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, fixed <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\theta \in (0,1),\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>∈</mo> <mo stretchy="false">(</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> inspired by the recent work of Zhao (Rev Mat Iberoam 22:323–338, 2006), we can show that <Equation ID="Equ18"> <EquationSource Format="TEX">\( \sum _{x&lt;n\le 2x}\mu (n)\lambda _{f}(n)e(\alpha n^{\theta })\ll \left( x^{5/6}+x^{(1+\theta )/2}+x^{(2-\theta )/2}\right) (\log x)^{11/2}. \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <munder> <mo>∑</mo> <mrow> <mi>x</mi> <mo>&lt;</mo> <mi>n</mi> <mo>≤</mo> <mn>2</mn> <mi>x</mi> </mrow> </munder> <mi>μ</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msub> <mi>λ</mi> <mi>f</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mi>e</mi> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <msup> <mi>n</mi> <mi>θ</mi> </msup> <mo stretchy="false">)</mo> </mrow> <mo>≪</mo> <mfenced close=")" open="("> <msup> <mi>x</mi> <mrow> <mn>5</mn> <mo stretchy="false">/</mo> <mn>6</mn> </mrow> </msup> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>+</mo> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo>-</mo> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> </mfenced> <msup> <mrow> <mo stretchy="false">(</mo> <mo>log</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mrow> <mn>11</mn> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> <mo>.</mo> </mrow> </math></EquationSource> </Equation>This refines the classical <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(x^{5/6}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>x</mi> <mrow> <mn>5</mn> <mo stretchy="false">/</mo> <mn>6</mn> </mrow> </msup> </math></EquationSource> </InlineEquation>-type bounds and becomes optimal (apart from the powers of <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\log x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>log</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation>) in several ranges of <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\theta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>θ</mi> </math></EquationSource> </InlineEquation>. The proof uses an optimized Vaughan-type decomposition together with a contour shifting and precise exponential sum bounds. For the divisor weights, we have the hybrid estimate <Equation ID="Equ19"> <EquationSource Format="TEX">\(\begin{aligned}&amp;\sum _{x&lt;n\le 2x}\tau _{k}(n)\lambda _{f}(n)e(\alpha n^{\theta })\\&amp;\quad \ll \left( \min \left\{ x^{5/6}+x^{(2-\theta )/2},x^{1-1/2k}\right\} +x^{(1+\theta )/2}\right) x^{\varepsilon }, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd /> <mtd columnalign="left"> <mrow> <munder> <mo>∑</mo> <mrow> <mi>x</mi> <mo>&lt;</mo> <mi>n</mi> <mo>≤</mo> <mn>2</mn> <mi>x</mi> </mrow> </munder> <msub> <mi>τ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msub> <mi>λ</mi> <mi>f</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mi>e</mi> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <msup> <mi>n</mi> <mi>θ</mi> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow /> </mtd> <mtd columnalign="left"> <mrow> <mspace width="1em" /> <mo>≪</mo> <mfenced close=")" open="("> <mo movablelimits="true">min</mo> <mfenced close="}" open="{"> <msup> <mi>x</mi> <mrow> <mn>5</mn> <mo stretchy="false">/</mo> <mn>6</mn> </mrow> </msup> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo>-</mo> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> <mo>,</mo> <msup> <mi>x</mi> <mrow> <mn>1</mn> <mo>-</mo> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> <mi>k</mi> </mrow> </msup> </mfenced> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>+</mo> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> </mfenced> <msup> <mi>x</mi> <mi>ε</mi> </msup> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\tau _{k}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>τ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is the number of representations of <i>n</i> as product of <i>k</i> natural numbers. This extends prior results limited to <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\theta =1/2.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>=</mo> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> For the exponential sums of the von Mangoldt function <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\Lambda (n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Λ</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> involving the Fourier coefficients <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\lambda _{\pi _{m}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>λ</mi> <msub> <mi>π</mi> <mi>m</mi> </msub> </msub> </math></EquationSource> </InlineEquation> of <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(SL_{m}({\mathbb {Z}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <msub> <mi>L</mi> <mi>m</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="double-struck">Z</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, under Hypothesis H of Rudnick–Sarnak, the bound <Equation ID="Equ20"> <EquationSource Format="TEX">\( \sum _{x&lt;n\le 2x}\Lambda (n)\lambda _{\pi _{m}}(n)e(\alpha n^{\theta })\ll \left( x^{5/6}+x^{(2+m\theta )/4}+x^{(2-\theta )/2}\right) x^{\varepsilon } \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <munder> <mo>∑</mo> <mrow> <mi>x</mi> <mo>&lt;</mo> <mi>n</mi> <mo>≤</mo> <mn>2</mn> <mi>x</mi> </mrow> </munder> <mi mathvariant="normal">Λ</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <msub> <mi>λ</mi> <msub> <mi>π</mi> <mi>m</mi> </msub> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mi>e</mi> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <msup> <mi>n</mi> <mi>θ</mi> </msup> <mo stretchy="false">)</mo> </mrow> <mo>≪</mo> <mfenced close=")" open="("> <msup> <mi>x</mi> <mrow> <mn>5</mn> <mo stretchy="false">/</mo> <mn>6</mn> </mrow> </msup> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo>+</mo> <mi>m</mi> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>4</mn> </mrow> </msup> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo>-</mo> <mi>θ</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> </mfenced> <msup> <mi>x</mi> <mi>ε</mi> </msup> </mrow> </math></EquationSource> </Equation>is obtained and for <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(m\ge 5,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>5</mn> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> additional unconditional estimates follow from Rankin–Selberg theory, zero-density results for automorphic <i>L</i>-functions, and explicit formula methods.</p>

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

Oscillations of Hecke Eigenvalues Twisted with Exponential Functions

  • Wei Zhang

摘要

In this paper, we study oscillations problem according to the Hecke eigenvalues for Maass cusp forms with Fourier coefficients \(\lambda _{f}(n)\) λ f ( n ) in exponential sums. For Möbius function \(\mu (n)\) μ ( n ) , fixed \(\theta \in (0,1),\) θ ( 0 , 1 ) , inspired by the recent work of Zhao (Rev Mat Iberoam 22:323–338, 2006), we can show that \( \sum _{x<n\le 2x}\mu (n)\lambda _{f}(n)e(\alpha n^{\theta })\ll \left( x^{5/6}+x^{(1+\theta )/2}+x^{(2-\theta )/2}\right) (\log x)^{11/2}. \) x < n 2 x μ ( n ) λ f ( n ) e ( α n θ ) x 5 / 6 + x ( 1 + θ ) / 2 + x ( 2 - θ ) / 2 ( log x ) 11 / 2 . This refines the classical \(x^{5/6}\) x 5 / 6 -type bounds and becomes optimal (apart from the powers of \(\log x\) log x ) in several ranges of \(\theta \) θ . The proof uses an optimized Vaughan-type decomposition together with a contour shifting and precise exponential sum bounds. For the divisor weights, we have the hybrid estimate \(\begin{aligned}&\sum _{x<n\le 2x}\tau _{k}(n)\lambda _{f}(n)e(\alpha n^{\theta })\\&\quad \ll \left( \min \left\{ x^{5/6}+x^{(2-\theta )/2},x^{1-1/2k}\right\} +x^{(1+\theta )/2}\right) x^{\varepsilon }, \end{aligned}\) x < n 2 x τ k ( n ) λ f ( n ) e ( α n θ ) min x 5 / 6 + x ( 2 - θ ) / 2 , x 1 - 1 / 2 k + x ( 1 + θ ) / 2 x ε , where \(\tau _{k}(n)\) τ k ( n ) is the number of representations of n as product of k natural numbers. This extends prior results limited to \(\theta =1/2.\) θ = 1 / 2 . For the exponential sums of the von Mangoldt function \(\Lambda (n)\) Λ ( n ) involving the Fourier coefficients \(\lambda _{\pi _{m}}\) λ π m of \(SL_{m}({\mathbb {Z}})\) S L m ( Z ) , under Hypothesis H of Rudnick–Sarnak, the bound \( \sum _{x<n\le 2x}\Lambda (n)\lambda _{\pi _{m}}(n)e(\alpha n^{\theta })\ll \left( x^{5/6}+x^{(2+m\theta )/4}+x^{(2-\theta )/2}\right) x^{\varepsilon } \) x < n 2 x Λ ( n ) λ π m ( n ) e ( α n θ ) x 5 / 6 + x ( 2 + m θ ) / 4 + x ( 2 - θ ) / 2 x ε is obtained and for \(m\ge 5,\) m 5 , additional unconditional estimates follow from Rankin–Selberg theory, zero-density results for automorphic L-functions, and explicit formula methods.