相关论文: Note on the Chowla Conjecture and the Discrete Fou…

This paper is a part of our programme to generalise the Hardy-Littlewood method to handle systems of linear questions in primes. This programme is laid out in our paper Linear Equations in Primes [LEP], which accompanies this submission. In…

Motivated by weighted partition of $n$ that vanish if and only if $n$ is a prime, Craig, van Ittersum, and Ono conjecture a classification of quasimodular forms which detect primes in the sense that the $n$-th Fourier coefficient vanishes…

We compute the one-level density for the family of cubic Dirichlet $L$-functions when the support of the Fourier transform of a test function is in $(-1,1)$. We also establish the Ratios conjecture prediction for the one-level density for…

In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete setting, even though in many applications the input signal is…

In this series of studies on Cauchy's function $f(z)$ ($z=x+iy$) and its integral $J[f(z)]\equiv (2\pi i)^{-1}\oint_C f(t)dt/(t-z)$ taken along a Jordan contour $C$, the aim is to investigate their comprehensive properties over the entire…

We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

We show that if $v\in A_\infty$ and $u\in A_1$, then there is a constant $c$ depending on the $A_1$ constant of $u$ and the $A_{\infty}$ constant of $v$ such that $$\Big\|\frac{ T(fv)} {v}\Big\|_{L^{1,\infty}(uv)}\le c\, \|f\|_{L^1(uv)},$$…

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…

We study the Fourier transform windowed by a bump function. We transfer Jackson's classical results on the convergence of the Fourier series of a periodic function to windowed series of a not necessarily periodic function. Numerical…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

This paper presents a study of the discrete Toda equation $(\tau_n^t)^2+\tau_{n-1}^t\tau_{n+1}^t=\tau_n^{t-1}\tau_n^{t+1}$, that was introduced in 1977. In this paper, it has been proved that the algebraic solution of the discrete Toda…

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…

We construct iteratively a sequence of numbers k_{n} and Beurling functions A_{n} converging pointwise to -1 in [0,1]. We prove results which seems to suggest that each A_{n} is equal to a well known approximating sequence of functions…

Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend…

We study global convex solutions of the Monge-Amp\`ere equation \[ \det D^2 u = \mu \quad \text{in } \mathbb{R}^n, \] where $\mu \not\equiv 0$ is a nonnegative locally finite periodic Borel measure on $\mathbb{R}^n$. We prove a…

We study computing the convolution of a private input $x$ with a public input $h$, while satisfying the guarantees of $(\epsilon, \delta)$-differential privacy. Convolution is a fundamental operation, intimately related to Fourier…

Let $F$ be a number field, $k$ a positive integer. In this paper, we define the Mobius and Liouville functions of order $k$ in $F$. We give a formula about the partial sums of them by using elementary number theory and complex analysis.…

Conrey, Farmer and Zirnbauer introduced a recipe to find asymptotic formulas for the sum of ratios of products of shifted L-functions. These ratios conjectures are very powerful and can be used to determine many statistics of L-functions,…