3,666 research outputs found

    On the mean square of the zeta-function and the divisor problem

    Full text link
    Let Δ(x)\Delta(x) denote the error term in the Dirichlet divisor problem, and E(T)E(T) the error term in the asymptotic formula for the mean square of ζ(1/2+it)|\zeta(1/2+it)|. If E(t)=E(t)2πΔ(t/2π)E^*(t) = E(t) - 2\pi\Delta^*(t/2\pi) with Δ(x)=Δ(x)+2Δ(2x)12Δ(4x)\Delta^*(x) = -\Delta(x) + 2\Delta(2x) - {1\over2}\Delta(4x), then we obtain the asymptotic formula 0T(E(t))2dt=T4/3P3(logT)+Oϵ(T7/6+ϵ), \int_0^T (E^*(t))^2 {\rm d} t = T^{4/3}P_3(\log T) + O_\epsilon(T^{7/6+\epsilon}), where P3P_3 is a polynomial of degree three in logT\log T with positive leading coefficient. The exponent 7/6 in the error term is the limit of the method.Comment: 10 page

    Survey on counting special types of polynomials

    Full text link
    Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of multivariate polynomials over a finite field, namely the the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), the relatively irreducible ones (irreducible but reducible over an extension field), the decomposable ones, and also for reducible space curves. These come as exact formulas and as approximations with relative errors that essentially decrease exponentially in the input size. Furthermore, a univariate polynomial f is decomposable if f = g o h for some nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials. The tame case, where the characteristic p of Fq does not divide n = deg f, is fairly well-understood, and we obtain closely matching upper and lower bounds on the number of decomposable polynomials. In the wild case, where p does divide n, the bounds are less satisfactory, in particular when p is the smallest prime divisor of n and divides n exactly twice. The crux of the matter is to count the number of collisions, where essentially different (g, h) yield the same f. We present a classification of all collisions at degree n = p^2 which yields an exact count of those decomposable polynomials.Comment: to appear in Jaime Gutierrez, Josef Schicho & Martin Weimann (editors), Computer Algebra and Polynomials, Lecture Notes in Computer Scienc

    Approximate computations with modular curves

    Full text link
    This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations with modular curves and their Jacobians. These approximations are done in polynomial time in the dimension and the required number of significant digits. We explain the main ideas of how the approximations are done, illustrating them with examples, and we sketch some applications in number theory
    corecore