HOW BIG ARE THE LAG INCREMENTS OF A 2-PARAMETER WIENER PROCESS? (II)

The author investigated how big the lag increments of a 2-parameter Wiener process is in [1]. In this paper the limit inferior results for the lag increments are discussed and the same results as the Wiener process are obtained. For example, if $\[\mathop {\lim }\limits_{T \to \infty } \{ \log T/{a_T} + \log (\log {b_T}/a_T^{1/2} + 1)\} /\log \log T = r,0 \leqslant r \leqslant \infty \] $ then $\[\mathop {\lim }\limits_{\overline {T \to \infty } } \mathop {\sup }\limits_{{a_T} \leqslant t \leqslant T} \mathop {\sup }\limits_{t \leqslant s \leqslant T} \mathop {\sup }\limits_{R \in L_s^*(t)} |W(R)|/d(T,t) = {\alpha _r},a.s.,\] $ $\[\mathop {\lim }\limits_{\overline {T \to \infty } } \mathop {\sup }\limits_{{a_T} \leqslant t \leqslant T} \mathop {\sup }\limits_{R \in {{\tilde L}_T}(t)} |W(R)|/d(T,t) = {\alpha _r},a.s.,\] $ where $\alpha _r=(r/(r+1))^{1/2}$, $L*_s(t)$ and $\tider L_T(t)$ are the sets of rectangles which satisfy some conditions. Moreover, the limit inferior results of another class of lag increments are discussed.     

ON THE GROWTH OF SOME RANDOM HYPERDIRICHLET SERIES

The paper considers the random L-Dirichlet seriesf(s,ω)=sum from n=1 to ∞ P_n(s,ω)exp(-λ_ns)and the random B-Dirichlet seriesψτ_0(s,ω)=sum from n=1 to ∞ P_n(σ iτ_0,ω)exp(-λ_ns),where {λ_n} is a sequence of positive numbers tending strictly monotonically to infinity, τ_0∈R is a fixed real number, andP_n(s,ω)=sum from j=1 to m_n ε_(nj)a_(nj)s~ja random complex polynomial of order m_n, with {ε_(nj)} denoting a Rademacher sequence and {a_(nj)} a sequence of complex constants. It is shown here that under certain very general conditions, almost all the random entire functions f(s,ω) and ψ_(τ_0)(s,ω) have, in every horizontal strip, the same order, given byρ=lim sup((λ_nlogλ_n)/(log A_n~(-1)))whereA_n=max |a_(nj)|.Similar results are given if the Rademacher sequence {ε_(nj)} is replaced by a steinhaus seqence or a complex normal sequence.     

ON THE ERROR FUNCTION OF THE SQUARE-FULL INTEGERS

Let L(x) denote the number of square-full integers not exceeding x. It is proved in [1] thatL(x)～(ζ(3/2)/ζ(3))x~(1/2) (ζ(2/3)/ζ(2))x~(1/3) as x→∞,where ζ(s) denotes the Riemann zeta function. Let △(x) denote the error function in the asymptotic formula for L(x). It was shown by D. Suryanaryana~([2]) on the Riemann hypothesis (RH) that1/x integral from n=1 to x |△(t)|dt=O(x~(1/10 s))for every ε>0. In this paper the author proves the following asymptotic formula for the mean-value of △(x) under the assumption of R. H.integral from n=1 to T (△~2(t/t~(6/5))) dt～c log T,where c>0 is a constant.     

功率和的强逼近

设$\{\xi_n, n\geq 1\}$是正的随机变量序列, $\ep \xi_1=\theta>0$, 设$S_n = \sum\limits_{i=1}^n \xi_i, Y_n=n\theta\log (S_n/(n\theta))$. 在该文中, 当$\{\xi_n\}$是独立同分布或强平稳$\varphi$ -混合的正随机变量序列时,作者给出功率和$\{Y_n\}$用Wiener过程的强逼近结果.     

THE FUNCTION {\tf d}$_{{\boldkey k}}$({\tf n}) AT CONSECUTIVE INTEGERS

Let $d_{k}(n)$ denote the $k$-fold iterated divisor function $(k\geq 2)$. It is proved that for sufficiently large $x$, $d_{k}(n)=d_{k}(n+1)$ holds for $\gg x(\log\log x)^{-3}$ integers $n\leq x$.     

THE PRIMAL—DUAL POTENTIAL REDUCTION ALGORITHM FOR POSITIVE SEMI—DEFINITE PROGRAMMING

In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. The complexity of the algorithm is either O(nlog(X0 · S0/ε) or O(nlog(X0· S0/ε) depends on the value of ρ in the primal-dual potential function, where X0 and S0 is the initial interior matrices of the positive semi-definite programming.     

Maximal inequalities for the Ornstein-Uhlenbeck process

Let be the Ornstein-Uhlenbeck velocity process solving

with , where 0$"> and is a standard Brownian motion. Then there exist universal constants 0$">and 0$"> such that

for all stopping times of . In particular, this yields the existence of universal constants 0$"> and 0$"> such that

for all stopping times of . This inequality may be viewed as a stopped law of iterated logarithm. The method of proof relies upon a variant of Lenglart's domination principle and makes use of Itô calculus.

     

Moments of L-Functions Attached to the Twist of Modular Form by Dirichlet Characters

Let f(z) be a holomorphic cusp form of weight κ with respect to the full modular group SL2(Z). Let L(s, f) be the automorphic L-function associated with f(z) and χ be a Dirichlet character modulo q. In this paper, the authors prove that unconditionally for k =1/n with n ∈ N,and the result also holds for any real number 0 k 1 under the GRH for L(s, f ■χ).The authors also prove that under the GRH for L(s, f ■χ),for any real number k 0 and any large prime q.     

Joint asymptotic distribution of exceedances point process and partial sum of stationary Gaussian sequence

Let {X _i } _i=1^∞ be a standardized stationary Gaussian sequence with covariance function r(n) = EX ₁ X _n+1, S _n = Σ _i=1 ⁿ X _i , and $\bar X_n = \tfrac{{S_n }} {n} $\bar X_n = \tfrac{{S_n }} {n} . And let N _n be the point process formed by the exceedances of random level $(\tfrac{x} {{\sqrt {2\log n} }} + \sqrt {2\log n} - \tfrac{{\log (4\pi \log n)}} {{2\sqrt {2\log n} }})\sqrt {1 - r(n)} + \bar X_n $(\tfrac{x} {{\sqrt {2\log n} }} + \sqrt {2\log n} - \tfrac{{\log (4\pi \log n)}} {{2\sqrt {2\log n} }})\sqrt {1 - r(n)} + \bar X_n by X ₁,X ₂,…, X _n . Under some mild conditions, N _n and S _n are asymptotically independent, and N _n converges weakly to a Poisson process on (0,1].     

自正则化和Davis大数律和重对数律的精确渐近性

本文证明了自正则化Davis大数律和重对数律的精确渐近性, 即 {\heiti\bf 定理1}\hy 设$\ep X=0$, 且$\ep X^2I_{(|X|\leq x)}$在无穷远处是缓变函数, 则$\lim_{\varepsilon\searrow0}\varepsilon^2\tsm_{n\geq3}\frac{1}{n\log n}\pr\Big(\Big|\frac{S_n}{V_n}\Big|\geq\varepsilon\sqrt{\log\log n}\Big)=1.${\heiti\bf 定理2}\hy 设$\ep X=0$, 且$\ep X^2I_{(|X|\leq x)}$在无穷远处是缓变函数, 则对本文证明了目正则化Davis大数律和重对数律的精确渐近性,即定理1设EX=0,且EX~2I_(|x|≤x)在无穷远处是缓变函数,则■定理2设EX=0,且EX~2I_(|x|≤x)在无穷远处是缓变函数,则对0≤δ≤1,有■其中N为标准正态随机变量．     

UNIFORM STRONG CONVERGENCE RATE OF NEAREST NEIGHBOR DENSITY ESTIMATION

Based on [3] and [4],the authors study strong convergence rate of the k_n-NNdensity estimate f_n(x)of the population density f(x),proposed in [1].f(x)>0 and fsatisfies λ-condition at x(0<λ≤2),then for properly chosen k_nlim sup(n/(logn)~(λ/(1 2λ))丨_n(x)-f(x)丨C a.s.If f satisfies λ-condition,then for propeoly chosen k_nlim sup(n/(logn)~(λ/(1 3λ)丨_n(x)-f(x)丨C a.s.,where C is a constant.An order to which the convergence rate of 丨_n(x)-f(x)丨andsup 丨_n(x)-f(x)丨 cannot reach is also proposed.     

Fast Parallel Algorithms for Computing Generalized Inverses $A^+$ and $A_{MN}^+$

The parallel arithmetic complexities for computing generalized inverse $A^+$, computing the minimum-norm least-squares solution of $Ax=b$, computing order $m+n-r$ determinants and finding the characteristic polynomials of order $m+n-r$ matrices are shown to have the same grawth rate. Algorithms are given that compute $A^+$ and $A_{MN}^+$ in $O(\log r\dot \log n+\log m)$ and $O(\log^2n+\log m)$ steps using a number of processors which is a polynomial in $m, \ n$ and $r$ $(A\in B_r^{m\times n},r=rank \ A)$.     

Linear law for the logarithms of the Riemann periods at simple critical zeta zeros

Each simple zero of the Riemann zeta function on the critical line with is a center for the flow of the Riemann xi function with an associated period . It is shown that, as ,

Numerical evaluation leads to the conjecture that this inequality can be replaced by an equality. Assuming the Riemann Hypothesis and a zeta zero separation conjecture for some exponent , we obtain the upper bound . Assuming a weakened form of a conjecture of Gonek, giving a bound for the reciprocal of the derivative of zeta at each zero, we obtain the expected upper bound for the periods so, conditionally, . Indeed, this linear relationship is equivalent to the given weakened conjecture, which implies the zero separation conjecture, provided the exponent is sufficiently large. The frequencies corresponding to the periods relate to natural eigenvalues for the Hilbert-Polya conjecture. They may provide a goal for those seeking a self-adjoint operator related to the Riemann hypothesis.

     

DAVENPORT''''S THEOREM IN SHORT INTERVALS

Let μ be te Mbius function. It is proved that for any A>0sum from n=x0), which generalizes H. Davenport's theorem for Mbius function to short intervals.     

On the linear independence measure of logarithms of rational numbers

In this paper we give a general theorem on the linear independence measure of logarithms of rational numbers and, in particular, the linear independence measure of and of . We also give a method to search for polynomials of smallest norm on a real interval which may be suitable for computing or improving the linear independence measure of logarithms of rational numbers.

     

在${\mathbb{R}}^m$中重对数广义律的精确速率

令\{$X$, $X_n$, $n\ge 1$\}是期望为${\mathbb{E}}X=(0,\ldots,0)_{m\times 1}$和协方差阵为${\rm Cov}(X,X)=\sigma^2I_m$的独立同分布的随机向量列, 记$S_n=\sum_{i=1}^{n}X_i$, $n\ge 1$. 对任意$d>0$和$a_n=o((\log\log n)^{-d})$, 本文研究了${{\mathbb{P}}(|S_n|\ge (\varepsilon+a_n)\sigma \sqrt{n}(\log\log n)^d)$的一类加权无穷级数的重对数广义律的精确速率.     

ON THE DIOPHANTINE EQUATION $\[\sum\limits_{i = 0}^k {\frac{1}{{{x_i}}}} = \frac{a}{n}\]$

In this paper,, the author proves the following result: Let $\[{E_{a,k}}(N)\]$ denote the number of natural numbers $\[n \le N\]$ for which equation $$\[\sum\limits_{i = 0}^k {\frac{1}{{{x_i}}}} = \frac{a}{n}\]$$ is insolable in positive integers $\[{x_i}(i = 0,1, \cdots ,k)\]$.Then $$\[{E_{a,k}}(N) \ll N\exp \{ - C{(\log N)^{1 - \frac{1}{{k + 1}}}}\} \]$$ where the implied constant depends on a and K.     

Hausdorff Dimension of a Class of Weierstrass Functions

It was proved by Shen that the graph of the classical Weierstrass function $\sum_{n=0}^\infty \lambda^n \cos (2\pi b^n x)$ has Hausdorff dimension $2+\log \lambda/\log b$, for every integer $b\geq 2$ and every $\lambda\in (1/b,1)$ [Hausdorff dimension of the graph of the classical Weierstrass functions, Math. Z., 289 (2018), 223–266]. In this paper, we prove that the dimension formula holds for every integer $b\geq 3$ and every $\lambda\in (1/b,1)$ if we replace the function $\cos$ by $\sin$ in the definition of Weierstrass function. A class of more general functions are also discussed.     

关于一类实二次域的类数与基本单位的上界

设素数P≡1(mod4),k,ε分别表示实二次域Q(p~(1/2))类数和基本单位．本文改进了类数h和基本单位ε的上界,证明了:hlogeε<1/4(p~(1/2) 6)log(2ep~(1/2)),并得到了几个重要的推论．     

Some consequences of the Lindelöf conjecture

Suppose that the Lindelöf conjecture is valid in the following quantitative form: $$|\zeta (\frac{1}{2} + it)| \leqslant c_0 |t|^{\varepsilon (|t|)} $$ , where ε(t) is a monotone decreasing function, $\varepsilon (2t) \geqslant \tfrac{1}{2}\varepsilon (t),\varepsilon (t) \geqslant \tfrac{1}{{\sqrt {log t} }}$ . Then it is proved that for |t|≥T₀ the disk $\{ s:|s - \tfrac{1}{2} - it| \leqslant v\} $ contains at most 20v log |t| zeros of ζ(s) if $\tfrac{1}{2} \geqslant v \geqslant \sqrt {\varepsilon (t)} $ . There exists an absolute constant A such that for |t|≥T₁ the disk $\{ s:|s - \tfrac{1}{2} - it| \leqslant A\varepsilon ^{\tfrac{1}{3}} (t)\} $ contains at least one zero of ζ(s). Bibliography: 2 titles.