ﻻ يوجد ملخص باللغة العربية
We study the asymptotic behaviour of the prime pair counting function $pi_{2k}(n)$ by the means of the discrete Fourier transform on $mathbb{Z}/ nmathbb{Z}$. The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method. We discuss some advantages this has over the Fourier series on $mathbb{R} /mathbb{Z}$, which is used in the circle method. We show how to recover the main term for $pi_{2k}(n)$ predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on $mathbb{Z}/ nmathbb{Z}$ and on its subgroup $mathbb{Z}/ Qmathbb{Z},$ $Q , | , n.$
We study the prime pair counting functions $pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of $pi_{2k}(x)
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the DFT. The tr
In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The two parallel algorithms are associated with two formulations of DFT: one is based on the Kronecker pro
This paper deals with the inequalities devoted to the comparison between the norm of a function on a compact hypergroup and the norm of its Fourier coefficients. We prove the classical Paley inequality in the setting of compact hypergroups which furt
In this note besides two abstra