Results 1 to 10 of about 34 (34)
On the quadratic residues and their distribution properties
The main purpose of this article is to use elementary methods and properties of classical Gauss sums to determine identities for the number of residue systems of aa mod pp such that aa, a+a¯a+\bar{a}, and a−a¯a-\bar{a} are all quadratic residues ...
Liu Xiaoge, Meng Yuanyuan
doaj +1 more source
A variant of the large sieve inequality with explicit constants
We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a
Grześkowiak Maciej
doaj +1 more source
We determine the order of magnitude of $\mathbb{E}|\sum _{n\leqslant x}f(n)|^{2q}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0\leqslant q\leqslant 1$.
ADAM J. HARPER
doaj +1 more source
Equidistribution Among Cosets of Elliptic Curve Points in Intervals
In a recent paper devoted to fault analysis of elliptic curve-based signature schemes, Takahashi et al. (TCHES 2018) described several attacks, one of which assumed an equidistribution property that can be informally stated as follows: given an elliptic ...
Kim Taechan, Tibouchi Mehdi
doaj +1 more source
Least totients in arithmetic progressions [PDF]
7 páginas.-- Mathematics Subject Classification: 11B50, 11L40, 11N64.Let N(a,m) be the least integer n (if exists) such that ro(n) =- a (mod m). Friedlander and Shparlinski proved that for any € > 0 there exists A = A(€) > 0 such that for any positive ...
Cilleruelo, Javier, Garaev, Moubariz Z.
core +1 more source
On squares in polynomial products [PDF]
9 páginas.-- Mathematics Subject Classification (2000) 11L40 · 11N36 · 11R11.Let f (X) ∈ Z[X] be an irreducible polynomial of degree D ≥ 2 and let N be a sufficiently large positive integer.
Cilleruelo, Javier +4 more
core +1 more source
ON BINARY CORRELATIONS OF MULTIPLICATIVE FUNCTIONS
We study logarithmically averaged binary correlations of bounded multiplicative functions $g_{1}$ and $g_{2}$ . A breakthrough on these correlations was made by Tao, who showed that the
JONI TERÄVÄINEN
doaj +1 more source
The GL(n, Fp)—invariance of the Potts Hamiltonian
After defining a meanfield by arithmetic means, using multiplicative characters of finite fields, its Potts Hamiltonian is exactly computed. Moreover, it proves to be invariant with respect to every change of basis in Fq over the prime field Fp.
Mihai Caragiu, Mellita Caragiu
wiley +1 more source
On the two-term exponential sums and character sums of polynomials
The main aim of this paper is to use the analytic methods and the properties of the classical Gauss sums to research the computational problem of one kind hybrid power mean containing the character sums of polynomials and two-term exponential sums modulo
Ma Yuankui, Zhang Wenpeng
doaj +1 more source
In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source

