Related papers: Weighted exponential sums and its applications
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…
Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…
Let f be a sum of exponentials of the form exp(2 pi i N x), where the N are distinct integers. We call f an idempotent trigonometric polynomial (because the convolution of f with itself is f) or, simply, an idempotent. We show that for…
Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…
This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Boolean functions. In particular, the periodicity modulo $p$ ($p$ odd prime) of exponential sums of symmetric Boolean…
Using Katz's equidistribution framework, we show that for any squarefree polynomial $f \in \mathbb{F}_q[t]$ of degree $n \ge 2$, every residue class modulo $f$ can be represented as a product of two monic irreducible polynomials of degree…
Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…
We prove an explicit integral formula for computing the product of two shifted Riemann zeta functions everywhere in the complex plane. We show that this formula implies the existence of infinite families of exact exponential sum identities…
Tur\'an observed that logarithmic partial sums $\sum_{n\le x}\frac{f(n)}{n}$ of completely multiplicative functions (in the particular case of the Liouville function $f(n)=\lambda(n)$) tend to be positive. We develop a general approach to…
We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…
Let $f=\sum_{n=0}^\infty f_n x^n \in \overline{\mathbb Q}[[x]$ be a solution of an algebraic differential equation $Q(x,y(x), \ldots, y^{(k)}(x))=0$, where $Q$ is a multivariate polynomial with coefficients in $\overline{\mathbb Q}$. The…
We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.
By adapting the moment method developed by Granville and Soundararajan [17], Khan, Milinovich and Subedi [24] recently obtained a weighted version of the Erd\H{o}s--Kac theorem for $\omega(n)$ with multiplicative weight $d_k(n)$, where…
We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
Let $\zeta^k(s) = \sum_{n=1}^\infty \tau_k(n) n^{-s}, \Re s > 1$. We present three conditional results on the ternary additive correlation sum $$\sum_{n\le X} \tau_3(n) \tau_3(n+h),\quad (h\ge 1),$$ and give numerical verifications of our…
Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…
In this paper we characterize, in terms of the prime divisors of $n$, the pairs $(k,n)$ for which $n$ divides $\sum_{j=1}^n j^{k}$. As an application, we study the sets $\mathcal{M}_f :=\{n: n \textrm{divides} \sum_{j=1}^n j^{f(n)} \}$ for…
We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…