An average bound for character sums with some counter-dependent recurrence sequences
type: Item
instance of: scholarly article
title: An average bound for character sums with some counter-dependent recurrence sequences
zbMATH Open document ID: 1181.11052
DOI: 10.1216/RMJ-2009-39-5-1403
author: Sanka Balasuriya
author: Igor E. Shparlinski
author: Arne Winterhof
published in: Rocky Mountain Journal of Mathematics
publication date: 2009-10-13T00:00:00Z
review text: There are several recent papers in the literature giving nontrivial upper bounds for multiplicative and additive character sums with \(n!\) and other related combinatorial sequences. Inspired by these papers, the authors take a prime \(p\) and the sequence \((a_{\alpha}(n))_{n\geq 0}\) satisfying the recurrence \(a_{\alpha}(n)=na_{\alpha}(n-1)+1\) for all \(n\geq 1\) and with \(a_{\alpha}(0)=\alpha\in {\mathbb F}_p\), the finite field with \(p\) elements. Note that when \(\alpha=0\), the general term of the above sequence is \(a_0(n)=\lfloor (e-2)n!\rfloor\). The paper deals with the sum \[ W_{\nu}(\chi,\psi,N)={{1}\over {p}}\sum_{\alpha=0}^{p-1} \left|\sum_{n=0}^{N-1} \chi(a_{\alpha}(n))\psi(a_{\alpha}(n))\right|^{\nu}, \] where \((\chi,\psi)\) is a pair consisting of a multiplicative and an additive character of \({\mathbb F}_p\), not both trivial. Their main result is that if \(\nu\) is a nonnegative integer and \(N\leq p\), then \[ W_{2\mu}(\chi,\psi,N)=O\left(N^{2\mu-1} \max\left\{Np^{-1/2},N^{1/(\mu+1)}\right\}\right). \] The proof starts with the inner sum for \(W_1(\chi,\psi,N)\) and observes that its size does not change much is we shift the range of summation from \([0,N-1]\) to \([1,N]\), or \([2,N+1]\), or, in general, to \([K,N+K-1]\), where \(K\) is some suitable chosen parameter. With this observation, one can replace the inner sum for \(W_1(\chi,\psi,N)\) by a double sum inside which one can reverse the order of summation. Now the inner sums of \(W_{2\mu}(\chi,\psi,N)\) are related to the above double sums via Hölder's inequality. For the rest of the proof, one reduces the problem to an instance where one can use Weil's estimate for character sums with nonconstant rational functions in \({\mathbb F}_p\). A nontrivial amount of effort is spend insuring that the various rational functions that show up and to which Weil's bound is applied are indeed nonconstant. The paper concludes by observing that their result implies via the Cauchy-Schwartz inequalit…
reviewed by: Florian Luca
Mathematics Subject Classification ID: 11L07
Mathematics Subject Classification ID: 11L40
zbMATH DE Number: 5614516
zbMATH Keywords: character sums
zbMATH Keywords: Weil bound
describes a project that uses: OEIS
MaRDI profile type: Publication
cites work: Prime divisors of some recurrence sequence
cites work: Character sums and congruences with 𝑛!
cites work: Exponential sums and congruences with factorials
cites work: Catalan and Apéry numbers in residue classes
cites work: Exponential sums with Catalan numbers and middle binomial coefficients
cites work: Q3509721
cites work: ON THE SQUARE-FREE PARTS OF ⌊en!⌋
cites work: Q3024032
cites work: ON THE DISTRIBUTION OF POWER RESIDUES AND PRIMITIVE ELEMENTS IN SOME NONLINEAR RECURRING SEQUENCES
cites work: Multiplicative character sums for nonlinear recurring sequences
cites work: Equations over finite fields. An elementary approach
cites work: Q4180448
cites work: On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q5830713
full work available at URL: rmj-2009-39-5-1403
OpenAlex ID: W2060573167
description: scientific article; zbMATH DE number 5614516