Related papers: Distribution of differences of characters evaluate…

Let $p$ be a prime number, $\mathbb{F}_{p^n}$ be the finite field of order $p^n$, and $\{\omega_1,\ldots\omega_n\}$ be a basis of $\mathbb{F}_{p^n}$ over $\mathbb{F}_p$. Let, further, $N_i,H_i$ be integers such that $1\leq H_i\leq p$,…

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Using a probabilistic model, based on random walks on the additive group $\mathbb{Z}/m\mathbb{Z}$, we prove that the values of certain real character sums are uniformly distributed in residue classes modulo $m$.

We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any $b$ there…

In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.

Building on the work of Arizmendi and Celestino (2021), we derive the $*$-distributions of polynomials in monotone independent and infinitesimally monotone independent elements. For non-zero complex numbers $\alpha$ and $\beta$, we derive…

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

For a nonprincipal character $\chi$ modulo $D$, when $x\ge D^{\frac56+\varepsilon}$, $(l,D) = 1$, we prove a nontrivial estimate of the form $\sum_{n\le x}\Lambda (n)\chi (n-l)\ll x\exp\left(-0.6\sqrt{\ln D}\right)$ for the sum of values of…

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

We investigate the variation in the total number of points in a random $p\times p$ square in $\mathbb{Z}^2$ where the $p$-adic valuation of a given polynomial in two variables is precisely $1$. We establish that this quantity follows a…

In this paper, we study the sum of additive characters over finite fields, with a focus on those of specified \(\mathbb{F}_q\)-Order. We establish a general formula for these character sums, providing an additive analogue to classical…

Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with $p^m$ elements for a prime $p$ and a positive integer $m$. Let…

We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…