NOTES ON GLAISHER＇S CONGRUENCES

Let p be an odd prime and let n≥1,k≥0 and r be integers,denote by Bk the kth Bernoulli number,It is proved that(i) If r≥1 is odd and suppose 1≥r+4,then ∑j=1^p-1 1/(np+j)^r=-(2n+1)r(r+1)/2(r+2)Bp-r-2p^2(mod p^3).(ii)If r≥2 is even and suppose p≥r+3, then p-1∑j=1 1/(np+j)^r=r/r+1Bv-r-1p(mod P^2).(iii) p-1∑j=1 1/(np+j)p-2=-(2n+1)p(mod P^2).This result generalizes the Glaisher‘s congruence. As a corollary, a generalization of the Wolsten-holme‘s theorem is obtained.     

Complete moment and integral convergence for sums of negatively associated random variables

For a sequence of identically distributed negatively associated random variables {Xn; n ≥ 1} with partial sums Sn = ∑i=1^n Xi, n ≥ 1, refinements are presented of the classical Baum-Katz and Lai complete convergence theorems. More specifically, necessary and sufficient moment conditions are provided for complete moment convergence of the form ∑n≥n0 n^r-2-1/pq anE（max1≤k≤n｜Sk｜^1/q-∈bn^1/qp）^＋〈∞to hold where r 〉 1, q 〉 0 and either n0 = 1,0 〈 p 〈 2, an = 1,bn = n or n0 = 3,p = 2, an = 1 （log n） ^1/2q, bn=n log n. These results extend results of Chow and of Li and Spataru from the indepen- dent and identically distributed case to the identically distributed negatively associated setting. The complete moment convergence is also shown to be equivalent to a form of complete integral convergence.     

On an exponential sum

Let p be a prime number, n be a positive integer, and ƒ(x) = ax^k + bx. We put

Asymptotic property of approximation to x αsgn x by Newman Type Operators

Approximation to the function ｜x｜ plays an important role in approximation theory. This paper studies the approximation to the function xαsgn x, which equals ｜x｜ if α = 1. We construct a Newman Type Operator rn（x） and prove max ｜x｜≤1｜xαsgn x-rn（x）｜～Cn1/4e-π1/2（1/2）αn.     

Integration and Lipschitz functions

The aim of the paper is to prove that every f ∈ L ¹([0,1]) is of the form f = , where j _n,k is the characteristic function of the interval [k- 1 / 2 ⁿ , k / 2 ⁿ ) and Σ _n=0^∞Σ _k=1²ⁿ |a _n,k | is arbitrarily close to ||f|| (Theorem 2). It is also shown that if μ is any probabilistic Borel measure on [0,1], then for any ɛ > 0 there exists a sequence (b _n,k ) _n≧0 ^k=1,...,2n of real numbers such that and for each Lipschitz function g: [0,1] → ℝ (Theorem 3).      

Inequalities for derivatives of functions in the spaces <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

  We obtain a new sharp inequality for the local norms of functions x ∈ L _{∞, ∞} ^r (R), namely,

Estimates for eigenvalues of Laplacian operator with any order

Let D be a bounded domain in an n-dimensional Euclidean space Rn. Assume that 0 ＜ λ1 ≤λ2 ≤ … ≤ λκ ≤ … are the eigenvalues of the Dirichlet Laplacian operator with any order l{(-△)lu=λu, in D u=(δ)u/(δ)(→n)=…(δ)l-1u/(δ)(→n)l-1=0,on (δ)D.Then we obtain an upper bound of the (k 1)-th eigenvalue λκ 1 in terms of the first k eigenvalues.k∑i=1(λκ 1-λi) ≤ 1/n[4l(n 2l-2)]1/2{k∑i=1(λκ 1-λi)1/2λil-1/l k∑i=1(λκ 1-λi)1/2λ1/li}1/2.This ineguality is independent of the domain D. Furthermore, for any l ≥ 3 the above inequality is better than all the known results. Our rusults are the natural generalization of inequalities corresponding to the case l = 2 considered by Qing-Ming Cheng and Hong-Cang Yang. When l = 1, our inequalities imply a weaker form of Yang inequalities. We aslo reprove an implication claimed by Cheng and Yang.     

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].     

多线性分数次积分算子交换子的有界性

Ibαf ( x) =∫R ∏mj=1( bj( x) - bj( y) ) 1| x - y| n-αf ( y) dyare considered.The following priori estimates are proved.For 1 01Φ1t| {y∈Rn:| Ibαf( y) | >t}| 1q ≤csupt>01Φ1t| {y∈Rn:ML( log L) 1r ,α(‖b‖f ) ( y) >t}| 1q,where‖b‖=∏mj=1‖bj‖Oscexp Lrj,Φ( t) =t( 1 + log+t) 1r,1r =1r1+ ...+ 1rm,ML(…     

Asymptotic behaviour of the phase in non-smooth obstacle scattering

In this paper, we study the asymptotic behaviour of the scattering phases(λ) of the Dirichlet Laplacian associated with obstacle , where Ω is a bounded open subset of ℝ ⁿ (n≥2) with non-smooth boundary ∂Ω and connected complement Ω _e =ℝ ⁿ . We can prove that if Ω satisfies a certain geometrical condition, then

Some convergence theorems on a supercritical Galton-Watson process

Summary LetX=(X _n; n≧0,X ₀=1) be a supercritical Galton-Watson process. The limiting distribution of ) where is the m.l.e. of the offspring mean, is derived. As an application of this result, some limit theorems leading ultimately to a parameter free result of statistical interest, are also established.     

A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression

Let r ₁, …, r _s be non-zero integers satisfying r ₁ + ⋯ + r _s = 0. Let G be a finite abelian group with k _i |k _i-1(2 ≤ i ≤ n), and suppose that (r _i , k ₁) = 1(1 ≤ i ≤ s). Let denote the maximal cardinality of a set which contains no non-trivial solution of r ₁ x ₁ + ⋯ + r _s x _s = 0 with . We prove that . We also apply this result to study problems in finite projective spaces.      

On estimation of a density and its derivatives

Summary Letf _n ^(p) be a recursive kernel estimate off ^(p) thepth order derivative of the probability density functionf, based on a random sample of sizen. In this paper, we provide bounds for the moments of and show that the rate of almost sure convergence of to zero isO(n ^−α), α<(r−p)/(2r+1), iff ^(r),r>p≧0, is a continuousL ₂(−∞, ∞) function. Similar rate-factor is also obtained for the almost sure convergence of to zero under different conditions onf. This work was supported in part by the Research Foundation of SUNY.     

Precise asymptotics in Chung’s law of the iterated logarithm

Let X, X1, X2,... be i.i.d, random variables with mean zero and positive, finite variance σ^2, and set Sn = X1 ＋... ＋ Xn, n≥1. The author proves that, if EX^2I{｜X｜≥t} = 0（（log log t）^-1） as t→∞, then for any a〉-1 and b〉 -1,lim ε↑1/√1＋a（1/√1＋a-ε）b＋1 ∑n=1^∞（logn）^a（loglogn）^b/nP{max κ≤n｜Sκ｜≤√σ^2π^2n/8loglogn（ε＋an）}=4/π（1/2（1＋a）^3/2）^b＋1 Г（b＋1）,whenever an = o（1/log log n）. The author obtains the sufficient and necessary conditions for this kind of results to hold.     

Hua’s theorem with nine almost equal prime variables

We sharpen Hua’s result by proving that each sufficiently large odd integer N can be written as

Stability of symmetric closed characteristics on symmetric compact convex hypersurfaces in ℝ<Superscript>2<Emphasis Type="Italic">n</Emphasis></Superscript> under a pinching condition

In this paper, let Σ R2n be a symmetric compact convex hypersurface which is ( r, R )- pinched with R/r (5/3)1/2 . Then Σ carries at least two elliptic symmetric closed characteristics; moreover, Σ carries at least E [ n-1/2 ] + E [ n-1/3 ] non-hyperbolic symmetric closed characteristics.     

On A Hypergraph Turán Problem Of Frankl

Let be the 2k-uniform hypergraph obtained by letting P₁, . . .,P_r be pairwise disjoint sets of size k and taking as edges all sets P_i∪P_j with i ≠ j. This can be thought of as the ‘k-expansion’ of the complete graph K_r: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain can be obtained by partitioning V = V1 ∪V₂ and taking as edges all sets of size 2k that intersect each of V₁ and V₂ in an odd number of elements. Let denote a hypergraph on n vertices obtained by this construction that has as many edges as possible. For n sufficiently large we prove a conjecture of Frankl, which states that any hypergraph on n vertices that contains no has at most as many edges as . Sidorenko has given an upper bound of for the Tur′an density of for any r, and a construction establishing a matching lower bound when r is of the form 2^p+1. In this paper we also show that when r=2^p+1, any -free hypergraph of density looks approximately like Sidorenko’s construction. On the other hand, when r is not of this form, we show that corresponding constructions do not exist and improve the upper bound on the Turán density of to , where c(r) is a constant depending only on r. The backbone of our arguments is a strategy of first proving approximate structure theorems, and then showing that any imperfections in the structure must lead to a suboptimal configuration. The tools for its realisation draw on extremal graph theory, linear algebra, the Kruskal–Katona theorem and properties of Krawtchouck polynomials. * Research supported in part by NSF grants DMS-0355497, DMS-0106589, and by an Alfred P. Sloan fellowship.     

On the ingham divisor problem

The main result of this paper is the following theorem. Suppose thatτ(n) = ∑ _d|n l and the arithmetical functionF satisfies the following conditions:

Some generalizations of Knopp's identity*

For integers a, b and n > 0, define

Hua＇s Theorem on Five Almost Equal Prime Squares

In this paper we sharpen Hua＇s result by proving that each sufficiently large integer N congruent to 5 modulo 24 can be written as N=p1^2＋p2^2＋p3^2＋p4^2＋p5^2,with │pj-√N/5│≤U=N^1/2-1/28＋ε,where pj are primes.