11,963 research outputs found

    On the Waring--Goldbach problem for eighth and higher powers

    Get PDF
    Recent progress on Vinogradov's mean value theorem has resulted in improved estimates for exponential sums of Weyl type. We apply these new estimates to obtain sharper bounds for the function H(k)H(k) in the Waring--Goldbach problem. We obtain new results for all exponents k8k\ge 8, and in particular establish that H(k)(4k2)logk+k7H(k)\le (4k-2)\log k+k-7 when kk is large, giving the first improvement on the classical result of Hua from the 1940s

    A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

    Full text link
    In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k > log_2 log n+omega(1), where omega(1) is any function going to infinity with n, then the minimum bounded-depth spanning tree still has weight tending to zeta(3) as n -> infinity, and that if k < log_2 log n, then the weight is doubly-exponentially large in log_2 log n - k. It is NP-hard to find the minimum bounded-depth spanning tree, but when k < log_2 log n - omega(1), a simple greedy algorithm is asymptotically optimal, and when k > log_2 log n+omega(1), an algorithm which makes small changes to the minimum (unbounded depth) spanning tree is asymptotically optimal. We prove similar results for minimum bounded-depth Steiner trees, where the tree must connect a specified set of m vertices, and may or may not include other vertices. In particular, when m = const * n, if k > log_2 log n+omega(1), the minimum bounded-depth Steiner tree on the complete graph has asymptotically the same weight as the minimum Steiner tree, and if 1 <= k <= log_2 log n-omega(1), the weight tends to (1-2^{-k}) sqrt{8m/n} [sqrt{2mn}/2^k]^{1/(2^k-1)} in both expectation and probability. The same results hold for minimum bounded-diameter Steiner trees when the diameter bound is 2k; when the diameter bound is increased from 2k to 2k+1, the minimum Steiner tree weight is reduced by a factor of 2^{1/(2^k-1)}.Comment: 30 pages, v2 has minor revision

    Decay estimates for nonlinear nonlocal diffusion problems in the whole space

    Get PDF
    In this paper we obtain bounds for the decay rate in the L^r (\rr^d)-norm for the solutions to a nonlocal and nolinear evolution equation, namely, u_t(x,t) = \int_{\rr^d} K(x,y) |u(y,t)- u(x,t)|^{p-2} (u(y,t)- u(x,t)) \, dy, with x \in \rr^d, t>0 t>0. Here we consider a kernel K(x,y)K(x,y) of the form K(x,y)=ψ(ya(x))+ψ(xa(y))K(x,y)=\psi (y-a(x))+\psi(x-a(y)), where ψ\psi is a bounded, nonnegative function supported in the unit ball and aa is a linear function a(x)=Axa(x)= Ax. To obtain the decay rates we derive lower and upper bounds for the first eigenvalue of a nonlocal diffusion operator of the form T(u) = - \int_{\rr^d} K(x,y) |u(y)-u(x)|^{p-2} (u(y)-u(x)) \, dy, with 1p<1 \leq p < \infty. The upper and lower bounds that we obtain are sharp and provide an explicit expression for the first eigenvalue in the whole \rr^d: \lambda_{1,p} (\rr^d) = 2(\int_{\rr^d} \psi (z) \, dz)|\frac{1}{|\det{A}|^{1/p}} -1|^p. Moreover, we deal with the p=p=\infty eigenvalue problem studying the limit as pp \to \infty of λ1,p1/p\lambda_{1,p}^{1/p}

    Developing Jurisprudence On The Rights Of Youth: Review Of Problems And Prospects: North-South

    Get PDF
    Whatever civilization one analyses in history, one invariably finds generational conflicts of youth rebelling against the various systems (legal, political, economic, and/or socio-cultural) established by their adult generation
    corecore