133 research outputs found

    On a trigonometric sum

    Get PDF
    This article does not have an abstract

    Vinogradov's mean value theorem via efficient congruencing

    Get PDF
    We obtain estimates for Vinogradov's integral which for the first time approach those conjectured to be the best possible. Several applications of these new bounds are provided. In particular, the conjectured asymptotic formula in Waring's problem holds for sums of s kth powers of natural numbers whenever s is at least 2k^2+2k-3

    Close to Uniform Prime Number Generation With Fewer Random Bits

    Full text link
    In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime pp less than xx, the basic idea is to fix a constant qx1εq\propto x^{1-\varepsilon}, pick a uniformly random a<qa<q coprime to qq, and choose pp of the form a+tqa+t\cdot q, where only tt is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.L. Montgomery, made precise by Friedlander and Granville; then the Extended Riemann Hypothesis; and finally fully unconditionally using the Barban-Davenport-Halberstam theorem. We argue that this approach has a number of desirable properties compared to previous algorithms.Comment: Full version of ICALP 2014 paper. Alternate version of IACR ePrint Report 2011/48

    Rational approximation and arithmetic progressions

    Full text link
    A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a metrical and a non-metrical point of view and, on the other hand, from an asymptotic and also a uniform point of view. The principal novelty is a Khintchine type theorem for uniform approximation in this context. Some applications of this theory are also discussed

    On the average value of the least common multiple of k positive integers

    Get PDF
    We deduce an asymptotic formula with error term for the sum ∑n1,…,nk≤xf([n1,…,nk]), where [n1,…,nk] stands for the least common multiple of the positive integers n1,…,nk (k≥2) and f belongs to a large class of multiplicative arithmetic functions, including, among others, the functions f(n)=nr, φ(n)r, σ(n)r (r>−1 real), where φ is Euler's totient function and σ is the sum-of-divisors function. The proof is by elementary arguments, using the extension of the convolution method for arithmetic functions of several variables, starting with the observation that given a multiplicative function f, the function of k variables f([n1,…,nk]) is multiplicative

    A unitary test of the Ratios Conjecture

    Full text link
    The Ratios Conjecture of Conrey, Farmer and Zirnbauer predicts the answers to numerous questions in number theory, ranging from n-level densities and correlations to mollifiers to moments and vanishing at the central point. The conjecture gives a recipe to generate these answers, which are believed to be correct up to square-root cancelation. These predictions have been verified, for suitably restricted test functions, for the 1-level density of orthogonal and symplectic families of L-functions. In this paper we verify the conjecture's predictions for the unitary family of all Dirichlet LL-functions with prime conductor; we show square-root agreement between prediction and number theory if the support of the Fourier transform of the test function is in (-1,1), and for support up to (-2,2) we show agreement up to a power savings in the family's cardinality.Comment: Version 2: 24 pages, provided additional details, fixed some small mistakes and expanded the exposition in place

    Supersymmetric QCD corrections to e+etbˉHe^+e^-\to t\bar{b}H^- and the Bernstein-Tkachov method of loop integration

    Full text link
    The discovery of charged Higgs bosons is of particular importance, since their existence is predicted by supersymmetry and they are absent in the Standard Model (SM). If the charged Higgs bosons are too heavy to be produced in pairs at future linear colliders, single production associated with a top and a bottom quark is enhanced in parts of the parameter space. We present the next-to-leading-order calculation in supersymmetric QCD within the minimal supersymmetric SM (MSSM), completing a previous calculation of the SM-QCD corrections. In addition to the usual approach to perform the loop integration analytically, we apply a numerical approach based on the Bernstein-Tkachov theorem. In this framework, we avoid some of the generic problems connected with the analytical method.Comment: 14 pages, 6 figures, accepted for publication in Phys. Rev.

    O niektórych nowszych wynikach nauki o punktach siatkowych

    No full text

    Zur elementaren Zahlentheorie (berichtigung)

    No full text
    corecore