On Sums of Two Coprime k-th Powers(II)

For fixed k ≥ 3, let E_k(x) denote the error term of the sum , where 1. It is proved that if the Riemann hypothesis is true, then , . A short interval result is also obtained.     

Multiple recurrence and nilsequences

Aiming at a simultaneous extension of Khintchine(X,X,m,T)(X,\mathcal{X},\mu,T) and a set A ? XA\in\mathcal{X} of positive measure, the set of integers n such that A T^2nA T^knA)(A)^k+1-\mu(A{\cap} T^{n}A{\cap} T^{2n}A{\cap} \ldots{\cap} T^{kn}A)>\mu(A)^{k+1}-\epsilon is syndetic. The size of this set, surprisingly enough, depends on the length (k+1) of the arithmetic progression under consideration. In an ergodic system, for k=2 and k=3, this set is syndetic, while for kòf(x)f(Tⁿx)f(T²ⁿx)? f(T^knx)  dm(x)\int{f(x)f(T^{n}x)f(T^{2n}x){\ldots} f(T^{kn}x) \,d\mu(x)} , where k and n are positive integers and f is a bounded measurable function. We also derive combinatorial consequences of these results, for example showing that for a set of integers E with upper Banach density d^*(E)>0 and for all {n ? \mathbbZ\colon d^*(E?(E+n)?(E+2n)?(E+3n)) > d^*(E)⁴-e}\big\{n\in\mathbb{Z}{\colon} d^*\big(E\cap(E+n)\cap(E+2n)\cap(E+3n)\big) > d^*(E)^4-\epsilon\big\}     

A Remark on the Growth of the Denominators of Convergents

For log\frac1+?52 ￡ l_* ￡ l^* < ￥{\rm log}\frac{1+\sqrt{5}}{2}\leq \lambda_\ast \leq \lambda^\ast < \infty , let E(λ_*, λ^*) be the set {x ? [0,1): liminf_{n ? ￥}\fraclogq_n(x)n=l_*, limsup_{n ? ￥}\fraclogq_n(x)n=l^*}. \left\{x\in [0,1):\ \mathop{\lim\inf}_{n \rightarrow \infty}\frac{\log q_n(x)}{n}=\lambda_{\ast}, \mathop{\lim\sup}_{n \rightarrow \infty}\frac{\log q_n(x)}{n}=\lambda^{\ast}\right\}. It has been proved in [1] and [3] that E(λ_*, λ^*) is an uncountable set. In the present paper, we strengthen this result by showing that dimE(l_*, l^*) 3 \fracl_* -log\frac1+?522l^*\dim E(\lambda_{\ast}, \lambda^{\ast}) \ge \frac{\lambda_{\ast} -\log \frac{1+\sqrt{5}}{2}}{2\lambda^{\ast}}     

On exponential sums over primes in short intervals

Let Λ(n) be the von Mangoldt function, x real and y small compared with x. This paper gives a non-trivial estimate on the exponential sum over primes in short intervals S₂(x,y;a)=?_{x < n ￡ x+y}L(n)e(n² a)S_2(x,y;{\alpha})=\sum_{x < n \le x+y}\Lambda(n)e(n^2 {\alpha}) for all α ∈ [0,1] whenever x^\frac23+e ￡ y ￡ xx^{\frac{2}{3}+{\varepsilon}}\le y \le x . This result is as good as what was previously derived from the Generalized Riemann Hypothesis.     

On some Dirichlet series related to the Riemann zeta function,I

On the assumption of the truth of the Riemann hypothesis for the Riemann zeta function we construct a class of modified von-Mangoldt functions with slightly better mean value properties than the well known function L\Lambda . For every e ? (0,1/2)\varepsilon \in (0,1/2) there is a [(L)\tilde] : \Bbb N ? \Bbb C\tilde {\Lambda} : \Bbb N \to \Bbb C such that¶ i) [(L)\tilde] (n) = L (n) (1 + O(n^-1/4  logn))\tilde {\Lambda} (n) = \Lambda (n) (1 + O(n^{-1/4\,} \log n)) and¶ii) ?_{n \leqq x} [(L)\tilde] (n) (1- [(n)/(x)]) = [(x)/2] + O(x^1/4+e) (x \geqq 2).\sum \limits_{n \leqq x} \tilde {\Lambda} (n) \left(1- {{n}\over{x}}\right) = {{x}\over{2}} + O(x^{1/4+\varepsilon }) (x \geqq 2).¶Unfortunately, this does not lead to an improved error term estimation for the unweighted sum ?_{n \leqq x} [(L)\tilde] (n)\sum \limits_{n \leqq x} \tilde {\Lambda} (n), which would be of importance for the distance between consecutive primes.     

On a question of Erdös and Graham

We prove that for any $ \varepsilon > 0 $ \varepsilon > 0 there is k (e) k (\varepsilon) such that for any prime p and any integer c there exist k \leqq k(e) k \leqq k(\varepsilon) pairwise distinct integers x_i with 1 \leqq x_i \leqq p^e, i = 1, ?, k 1 \leqq x_{i} \leqq p^{\varepsilon}, i = 1, \ldots, k , and such that¶¶?_i=1^k [1/(x_i)] o c    (mod p). \sum\limits_{i=1}^k {{1}\over{x_i}} \equiv c\quad (\mathrm{mod}\, p). ¶¶ This gives a positive answer to a question of Erdös and Graham.     

On Sums of Two Coprime k-th Powers

For fixed k3, let It is known that the asymptotic formula holds for some constant c_k. Let E_k(x)=R_k(x)–c_kx^2/k. We cannot improve the exponent 1/k at present if we do not have further knowledge about the distribution of the zeros of the Riemann Zeta function (s). In this paper, we shall prove that if the Riemann Hypothesis (RH) is true, then E_k(x)=O(x^4/15+), which improves the earlier exponent 5/18 due to Nowak. A mean square estimate of E_k(x) for k6 is also obtained, which implies that E_k(x)=(x^1/k–1/k2) for k6 under RH.     

Irregular Wavelet Frames and Gabor Frames

Given g { l^\fracn2 g( l_j x - kb ) }_jezjezⁿ ,where  l_j \left\{ {\lambda ^{\frac{n}{2}} g\left( {\lambda _j x - kb} \right)} \right\}_{j\varepsilon zj\varepsilon z^n } ,where\;\lambda _j > 0 and b > 0. Sufficient conditions for the wavelet system to constitute a frame for L ²(R ⁿ ) are given. For a class of functions g{ e^{zrib( j,x )} g( x - l_k ) }_{jezⁿ ,kez}\left\{ {e^{zrib\left( {j,x} \right)} g\left( {x - \lambda _k } \right)} \right\}_{j\varepsilon z^n ,k\varepsilon z} to be a frame.     

Gaussian upper bounds for fundamental solutions of a family of parabolic equations

We study the family of divergence-type second-order parabolic equations w_e(x)\frac?u?t=div(a(x)w_e(x) ?u), x ? \mathbbRⁿ{\omega_\varepsilon(x)\frac{\partial u}{\partial t}={\rm div}(a(x)\omega_\varepsilon(x) \nabla u), x \in \mathbb{R}^n} , with parameter ${\varepsilon >0 }${\varepsilon >0 } , where a(x) is uniformly elliptic matrix and w_e=1{\omega_\varepsilon=1} for x _n  < 0 and w_e=e{\omega_\varepsilon=\varepsilon} for x _n  > 0. We show that the fundamental solution obeys the Gaussian upper bound uniformly with respect to e{\varepsilon} .     

On the sum of a prime and a k-th power of prime in short intervals

Let H_k\mathcal{H}_{k} denote the set {n∣2|n, n\not o 1 (mod p)n\not\equiv 1\ (\mathrm{mod}\ p) ∀ p>2 with p−1|k}. We prove that when X^{\frac1120(1-\frac12k) +e}\leqq H\leqq XX^{\frac{11}{20}\left(1-\frac{1}{2k}\right) +\varepsilon}\leqq H\leqq X, almost all integers n ? \allowbreak H_k ?(X, X+H]n\in\allowbreak {\mathcal{H}_{k} \cap (X, X+H]} can be represented as the sum of a prime and a k-th power of prime for k≧3. Moreover, when X^{\frac1120(1-\frac1k) +e}\leqq H\leqq XX^{\frac{11}{20}\left(1-\frac{1}{k}\right) +\varepsilon}\leqq H\leqq X, almost all integers n∈(X,X+H] can be represented as the sum of a prime and a k-th power of integer for k≧3.     

Type II Hermite�CPad�� Approximations of Generalized Hypergeometric Series

We shall present short proofs for type II (simultaneous) Hermite–Padé approximations of the generalized hypergeometric and q-hypergeometric series

A q-analogue of the FKG inequality and some applications

Let L be a finite distributive lattice and μ: L → ℝ⁺ a log-supermodular function. For functions k: L → ℝ⁺ let

On the Mean Value of the Index of Composition of an Integer

For each integer n l(n)=[(log n)/(log g(n))]\lambda(n)={{\rm log}\, n\over{\rm log}\, \gamma(n)} be the index of composition of n, where g(n)=?_p|np\gamma(n)=\prod_{p\vert n}p . For convenience, we write ?_{x ￡ n ￡ x+?x}l(n)\sum_{x\le n\le x+\sqrt{x}}\lambda(n) and ?_{n ￡ x}l(n)\sum_{n\le x}\lambda(n) , as well as for ?_{x ￡ n ￡ x+?x}1/l(n)\sum_{x\le n\le x+\sqrt{x}}1/\lambda(n) and ?_{n ￡ x}1/l(n)\sum_{n\le x}1/\lambda(n) . Finally we study the sum of running over shifted primes.     

Semiconcavity estimates for viscous Hamilton–Jacobi equations

We present sharp Hessian estimates of the form D² S^e(t,x) ￡ g(t)I{D^2 S^\varepsilon(t,x)\leq g(t)I} for the solution of the viscous Hamilton–Jacobi equation

How quadratic are the natural numbers?

Abstract. For natural numbers n we inspect all factorizations n = ab of n with a ￡ ba \le b in \Bbb N\Bbb N and denote by n=a_n b_nn=a_n b_n the most quadratic one, i.e. such that b_n - a_nb_n - a_n is minimal. Then the quotient k(n) : = a_n/b_n\kappa (n) := a_n/b_n is a measure for the quadraticity of n. The best general estimate for k(n)\kappa (n) is of course very poor: 1/n ￡ k(n) ￡ 11/n \le \kappa (n)\le 1. But a Theorem of Hall and Tenenbaum [1, p. 29], implies(logn)^-d-e ￡ k(n) ￡ (logn)^-d(\log n)^{-\delta -\varepsilon } \le \kappa (n) \le (\log n)^{-\delta } on average, with d = 1 - (1+log₂  2)/log2=0,08607 ?\delta = 1 - (1+\log _2 \,2)/\log 2=0,08607 \ldots and for every e > 0\varepsilon >0. Hence the natural numbers are fairly quadratic.¶k(n)\kappa (n) characterizes a specific optimal factorization of n. A quadraticity measure, which is more global with respect to the prime factorization of n, is k^*(n): = ?_{1 ￡ a ￡ b, ab=n} a/b\kappa ^*(n):= \textstyle\sum\limits \limits _{1\le a \le b, ab=n} a/b. We show k^*(n) ~ \frac 12\kappa ^*(n) \sim \frac {1}{2} on average, and k^*(n)=W(2^{\frac 12(1-e) log n/log ₂n})\kappa ^*(n)=\Omega (2^{\frac {1}{2}(1-\varepsilon ) {\log}\, n/{\log} _2n})for every e > 0\varepsilon>0.     

Prime Chains and Pratt Trees

Prime chains are sequences $p_{1}, \ldots , p_{k}Prime chains are sequences p₁, ?, p_kp_{1}, \ldots , p_{k} of primes for which p_j+1 o 1{p_{j+1} \equiv 1} (mod p _j ) for each j. We introduce three new methods for counting long prime chains. The first is used to show that N(x; p) = O_e(x^1+e){N(x; p) = O_{\varepsilon}(x^{1+\varepsilon})}, where N(x; p) is the number of chains with p ₁ = p and p_k ￡ p_x{p_k \leq p_x}. The second method is used to show that the number of prime chains ending at p is ≍ log p for most p. The third method produces the first nontrivial upper bounds on H(p), the length of the longest chain with p _k = p, valid for almost all p. As a consequence, we also settle a conjecture of Erdős, Granville, Pomerance and Spiro from 1990. A probabilistic model of H(p), based on the theory of branching random walks, is introduced and analyzed. The model suggests that for most p ￡ x{p \leq x}, H(p) stays very close to e log log x.     

Uniform estimates for order statistics and Orlicz functions

We establish uniform estimates for order statistics: Given a sequence of independent identically distributed random variables ξ ₁, … , ξ _n and a vector of scalars x = (x ₁, … , x _n ), and 1 ≤ k ≤ n, we provide estimates for \mathbb E   k-min_{1 ￡ i ￡ n} |x_ix_i|{\mathbb E \, \, k-{\rm min}_{1\leq i\leq n} |x_{i}\xi _{i}|} and \mathbb E k-max_{1 ￡ i ￡ n}|x_ix_i|{\mathbb E\,k-{\rm max}_{1\leq i\leq n}|x_{i}\xi_{i}|} in terms of the values k and the Orlicz norm ||y_x||_M{\|y_x\|_M} of the vector y _x  = (1/x ₁, … , 1/x _n ). Here M(t) is the appropriate Orlicz function associated with the distribution function of the random variable |ξ ₁|, G(t) = \mathbb P ({ |x₁| ￡ t}){G(t) =\mathbb P \left(\left\{ |\xi_1| \leq t\right\}\right)}. For example, if ξ ₁ is the standard N(0, 1) Gaussian random variable, then G(t) = ?{\tfrac2p}ò₀^t e^-\fracs22ds {G(t)= \sqrt{\tfrac{2}{\pi}}\int_{0}^t e^{-\frac{s^{2}}{2}}ds }  and M(s)=?{\tfrac2p}ò₀^se^-\frac12t2dt{M(s)=\sqrt{\tfrac{2}{\pi}}\int_{0}^{s}e^{-\frac{1}{2t^{2}}}dt}. We would like to emphasize that our estimates do not depend on the length n of the sequence.     

Additive polylogarithms and their functional equations

Let ${k[\varepsilon]_{2}:=k[\varepsilon]/(\varepsilon^{2})}Let k[e]₂:=k[e]/(e²){k[\varepsilon]_{2}:=k[\varepsilon]/(\varepsilon^{2})} . The single valued real analytic n-polylogarithm L_n: \mathbbC ? \mathbbR{\mathcal{L}_{n}: \mathbb{C} \to \mathbb{R}} is fundamental in the study of weight n motivic cohomology over a field k, of characteristic 0. In this paper, we extend the construction in ünver (Algebra Number Theory 3:1–34, 2009) to define additive n-polylogarithms li_n:k[e]₂? k{li_{n}:k[\varepsilon]_{2}\to k} and prove that they satisfy functional equations analogous to those of L_n{\mathcal{L}_{n}}. Under a mild hypothesis, we show that these functions descend to an analog of the nth Bloch group B_n￠(k[e]₂){B_{n}' (k[\varepsilon]_{2})} defined by Goncharov (Adv Math 114:197–318, 1995). We hope that these functions will be useful in the study of weight n motivic cohomology over k[ε]₂.     

A convexity theorem for multiplicative functions

We generalize a well known convexity property of the multiplicative potential function. We prove that, given any convex function g : \mathbbR^m ? [0, ￥]{g : \mathbb{R}^m \rightarrow [{0}, {\infty}]}, the function ${({\rm \bf x},{\rm \bf y})\mapsto g({\rm \bf x})^{1+\alpha}{\bf y}^{-{\bf \beta}}, {\bf y}>{\bf 0}}${({\rm \bf x},{\rm \bf y})\mapsto g({\rm \bf x})^{1+\alpha}{\bf y}^{-{\bf \beta}}, {\bf y}>{\bf 0}}, is convex if β ≥ 0 and α ≥ β ₁ + ··· + β _n . We also provide further generalization to functions of the form (x,y₁, . . . , y_n)? g(x)^1+af₁(y₁)^-b₁ ···f_n(y_n)^-b_n{({\rm \bf x},{\rm \bf y}_1, . . . , {y_n})\mapsto g({\rm \bf x})^{1+\alpha}f_1({\rm \bf y}_1)^{-\beta_1} \cdot \cdot \cdot f_n({\rm \bf y}_n)^{-\beta_n} } with the f _k concave, positively homogeneous and nonnegative on their domains.     

Hook Lengths and 3-Cores

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by