Effect of the initial estimator on the asymptotic behavior of one-step M-estimator

For a general (real) parameter, let M _nbe the M-estimator and M _n ⁽¹⁾ be its one-step version (based on a suitable initial estimator M _n ⁽⁰⁾). It is known that, under certain regularity conditions, n(M _n ⁽¹⁾-M _n)=O _p(1). The asymptotic distribution of n(M _n ⁽¹⁾-M _n) is studied; it is typically non-normal and it reveals the role of the initial estimator M _n ⁽⁰⁾.Work of this author was partially supported by the Office of Naval Research, Contract No. N00014-83-K-0387     

A class of Hamiltonian and edge symmetric Cayley graphs on symmetric groups

Abstract. Let Sn be the symmetric group     

Existence of frame SOLS of type ab

An SOLS (self-orthogonal latin square) of order v with n_i missing sub-SOLS (holes) of order h_i (1ik), which are disjoint and spanning (i.e. ∑_i=1^k n_ih_i=v), is called a frame SOLS and denoted by FSOLS(h₁^n₁h₂^n₂ h_k^n_k). It has been proved that for b2 and n odd, an FSOLS(aⁿb¹) exists if and only if n4 and n1+2b/a. In this paper, we show the existence of FSOLS(aⁿb¹) for n even and FSOLS(aⁿ1¹) for n odd.     

Some Hierarchies of Primitive Recursive Functions on Term Algebras

We compare two different Grzegorczyk hierarchies {H_n^σ}n≥0 and {L_n^σ}n≥1 on term algebras, which grow according to the height and length of terms, respectively. The solution of almost all inclusion problems among the Grzegorczyk classes and the (simultaneous) recursion number classes R_n^σ and S_n^σ on term algebras shows {H_n^σ}n≥0 to generalize Weihrauch's Grzegorczyk hierarchy on words {E_n^k}n≥0 to arbitrary term algebras. However, by regarding terms as words, {L_n^σ}n≥1 turns out to be computationally equivalent to Weihrauch's hierarchy {E_n^σ}n≥0 on the whole. Especially, L₂^σ} is equivalent to polynomial time computability and contains several natural term algebra functions. This establishes a notion of feasible term algebra functions and predicates.     

On the L2n 1– Extension Properties

We have proved that for all compact linear operator u from R into an L_p ([0,1], ν) (0 < p < 1) extends to L ₁ ([0,1], ν), where R denotes the closed linear subspace in L ₁ ([0,1], ν) of the Rademacher functions {r_n }_{n ? N}. In this paper, we study this type of extension for E_n ? L_2n ¹ where E_n is the n–dimensional subspace which appears in Kasin's theorem such that L_2n ¹ = E_n ⊕ E ^⊥ _n and the L_2n ¹ , L_2n ² norms are universally equivalent on both E_n , E ^⊥ _n. We show that, the precedent extension fails for the pair (E_n , L_2n ¹ ) and we generalize this to any E in an L ₁(Ω, A, P) by giving some conditions on E.     

A transitive closure algorithm

An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana ₁ N ₁ n+a ₂ n ² for largen wherea ₁ anda ₂ are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph andN ₁ is the number of arcs (not counting those arcs which are part of a cycle and not counting those arcs which can be removed without changing the transitive closure). For graphs where each arc is selected at random with probabilityp, the average time to compute the transitive closure is no greater than min{a ₁ pn ³+a ₂ n ², 1/2a ₁ n ² p ^–2+a ₂ n ²} for largen. The algorithm will compute the transitive closure of an undirected graph in a time no greater thana ₂ n ² for largen. The method uses aboutn ²+n bits and 5n words of storage (where each word can holdn+2 values).     

Higher order Willmore hypersurfaces in Euclidean space

Let x ： Mn^n→ R^n＋1 be an n（≥2）-dimensional hypersurface immersed in Euclidean space Rn＋1. Let σi（0≤ i≤ n） be the ith mean curvature and Qn = ∑i=0^n（-1）^i＋1 （n^i）σ1^n-iσi. Recently, the author showed that Wn（x） = ∫M QndM is a conformal invariant under conformal group of R^n＋1 and called it the nth Willmore functional of x. An extremal hypersurface of conformal invariant functional Wn is called an nth order Willmore hypersurface. The purpose of this paper is to construct concrete examples of the 3rd order Willmore hypersurfaces in Ra which have good geometric behaviors. The ordinary differential equation characterizing the revolutionary 3rd Willmore hypersurfaces is established and some interesting explicit examples are found in this paper.     

A note on the Σ1 collection scheme and fragments of bounded arithmetic

We show that for each n ≥ 1, if T₂ⁿ does not prove the weak pigeonhole principle for Σ^b_n functions, then the collection scheme B Σ₁ is not finitely axiomatizable over T₂ⁿ. The same result holds with Sⁿ₂ in place of T 2ⁿ (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new continuation method for complementarity problems with uniformP-functions

The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR ₊ ⁿ ofR ⁿ intoR ⁿ can be written as the system of equationsF(x, y) = 0 and(x, y) R ₊ ²ⁿ , whereF denotes the mapping from the nonnegative orthantR ₊ ²ⁿ ofR ²ⁿ intoR ₊ ⁿ × Rⁿ defined byF(x, y) = (x ₁y₁,,x_ny_n, f₁(x) – y₁,, f_n(x) – y_n) for every(x, y) R ₊ ²ⁿ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR ₊ ²ⁿ ontoR ₊ ⁿ × Rⁿ. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x ⁰, y⁰) and(x, y) R ₊ ²ⁿ from an arbitrary initial point(x ⁰, y⁰) R ₊ ²ⁿ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.     

New series of odd non-congruent numbers

We determine all square-free odd positive integers n such that the 2-Selmer groups S _n and Ŝ _n of the elliptic curve E _n : y ² = x(x − n)(x − 2n) and its dual curve ê _n : y ² = x ³ + 6nx ² + n ² x have the smallest size: S _n = {1}, Ŝ _n = {1, 2, n, 2n}. It is well known that for such integer n, the rank of group E _n (ℚ) of the rational points on E _n is zero so that n is a non-congruent number. In this way we obtain many new series of elliptic curves E _n with rank zero and such series of integers n are non-congruent numbers. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

On the parity of the class number of an imaginary abelian field of conductor 2<Superscript><Emphasis Type="Italic">a</Emphasis></Superscript><Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">b</Emphasis></Superscript>

Let p be an odd prime number, and p^n₀{p^{n_0}} the highest power of p dividing 2 ^p−1 − 1. Let K_n=Q(z_pⁿ⁺¹){K_n={\bf Q}(\zeta_{p^{n+1}})} and L_n,j=K_n⁺(z_2^j+2){L_{n,j}=K_n^+(\zeta_{2^{j+2}})} for j ≥ 0. Let h_n^*{h_n^*} be the relative class number of K _n , and h _n,j the class number of L _n,j , respectively. Let n be an integer with n ≥ n ₀. We prove that if the ratio h_n^*/h_n-1^*{h_n^*/h_{n-1}^*} is odd, then h _n,j /h _n−1,j is odd for any j ≥ 0.     

The fitting length of solvableH pn-groups

For a (finite) groupG and some prime powerp ⁿ, theH _p ⁿ -subgroupH _pn (G) is defined byH _p ⁿ (G)=〈xεG|x ^pn≠1〉. A groupH≠1 is called aH _p ⁿ -group, if there is a finite groupG such thatH is isomorphic toH _p ⁿ (G) andH _p ⁿ (G)≠G. It is known that the Fitting length of a solvableH _p ⁿ -group cannot be arbitrarily large: Hartley and Rae proved in 1973 that it is bounded by some quadratic function ofn. In the following paper, we show that it is even bounded by some linear function ofn. In view of known examples of solvableH _p ⁿ -groups having Fitting lengthn, this result is “almost” best possible.     

Strong Approximation Theorems for Sums of Random Variables when Extreme Terms are Excluded

Let {X _n ;n≥1} be a sequence of i.i.d. random variables and let X ^(r) _n = X _j if |X _j | is the r-th maximum of |X ₁|, ..., |X _n |. Let S _n = X ₁+⋯+X _n and ^(r) S _n = S _n −(X ⁽¹⁾ _n +⋯+X ^(r) _n ). Sufficient and necessary conditions for ^(r) S _n approximating to sums of independent normal random variables are obtained. Via approximation results, the convergence rates of the strong law of large numbers for ^(r) S _n are studied. Received March 22, 1999, Revised November 6, 2000, Accepted March 16, 2001     

The alternating semigroups: Generators and congruences

The idea of an even permutation has recently been generalized, via path notation, to one-one partial transformations (charts) in the symmetric inverse semigroupsC _n. The even charts form the alternating semigroupA _n ^c ⊂C _n . Generators ofA _n ^c are identified: It then follows that forn≥5,A _n ^c is the collection of restrictions of the even permutations (of rankn). Like theC _n case, the congruences ofA _n ^c form a chain. Part of this research was supported by a Mary Washington College faculty development grant.     

On deviations between empirical and quantile processes for mixing random variables

Let {X_n} be a strictly stationary φ-mixing process with Σ_j=1^∞ φ^1/2(j) < ∞. It is shown in the paper that if X₁ is uniformly distributed on the unit interval, then, for any t [0, 1], |F_n⁻¹(t) − t + F_n(t) − t| = O(n^−3/4(log log n)^3/4) a.s. and sup_0≤t≤1 |F_n⁻¹(t) − t + F_n(t) − t| = (O(n^−3/4(log n)^1/2(log log n)^1/4) a.s., where F_n and F_n⁻¹(t) denote the sample distribution function and tth sample quantile, respectively. In case {X_n} is strong mixing with exponentially decaying mixing coefficients, it is shown that, for any t [0, 1], |F_n⁻¹(t) − t + F_n(t) − t| = O(n^−3/4(log n)^1/2(log log n)^3/4) a.s. and sup_0≤t≤1 |F_n⁻¹(t) − t + F_n(t) − t| = O(n^−3/4(log n)(log log n)^1/4) a.s. The results are further extended to general distributions, including some nonregular cases, when the underlying distribution function is not differentiable. The results for φ-mixing processes give the sharpest possible orders in view of the corresponding results of Kiefer for independent random variables.     

Moments of the maximum of normed partial sums of ρ^--mixing random variables

Let {Xn,n ≥ 1} be a sequence of identically distributed ρ^--mixing random variables and set Sn =∑i^n=1 Xi,n ≥ 1,the suffcient and necessary conditions for the existence of moments of supn≥1 ｜Sn/n^1/r｜^p（0 〈 r 〈 2,p 〉 0） are given,which are the same as that in the independent case.     

Positive Bernstein-Sheffer Operators

Let h(t) = Σ_{n ≥ 1}h_nt_n, h₁ > 0, and exp(xh(t)) = Σ_{n ≥ 0}P_n(x) tⁿ/n!. For f C[0,1], the associated Bernstein-Sheffer operator of degree n is defined by B^h_nf(x) = P_n^{− 1} Σⁿ_{k = 0}f(k/n)(ⁿ_k) P_k(x) P_{n − k}(1 − x) where p_n = p_n(1). We characterize functions h for which B^h_n is a positive operator for all n ≥ 0. Then we give a necessary and sufficient condition insuring the uniform convergence of B^h_nf to f. When h is a polynomial, we give an upper bound for the error f − B^h_nf _∞. We also discuss the behavior of B^h_nf when h is a series with a finite or infinite radius of convergence.     

On the fluctuations of independent copies of moving maxima

Let {X_n, n1} be a sequence of independent random variables (r.v.'s) with a common distribution function (d.f.) F. Define the moving maxima Y_k(n)=max(X_n−k(n)+1,X_n−k(n)+2,…,X_n), where {k(n), n1} is a sequence of positive integers. Let Y_k(n)¹ and Y_k(n)² be two independent copies of Y_k(n). Under certain conditions on F and k(n), the set of almost sure limit points of the vector consisting of properly normalised Y_k(n)¹ and Y_k(n)² is obtained.     

Asymptotic Behavior of Heat Kernels on Spheres of Large Dimensions

Forn2, let (μ^x_τ, n)_τ0be the distributions of the Brownian motion on the unit sphereS^{n n+1}starting in some pointxSⁿ. This paper supplements results of Saloff-Coste concerning the rate of convergence ofμ^x_τ, nto the uniform distributionU_nonSⁿforτ→∞ depending on the dimensionn. We show that,[formula]forτ_n:=(ln n+2s)/(2n), where erf denotes the error function. Our proof depends on approximations of the measuresμ^x_τ, nby measures which are known explicitly via Poisson kernels onSⁿ, and which tend, after suitable projections and dilatations, to normal distributions on forn→∞. The above result as well as some further related limit results will be derived in this paper in the slightly more general context of Jacobi-type hypergroups.     

On large deviations and density functions

Suppose thatX ₁,X ₂, ... is a sequence of absolutely continuous or integer valued random variables with corresponding probability density functionsf _n (x). Let {φ _n } _n=1 ^∞ be a sequence of real numbers, then necessary and sufficient conditions are given forn ⁻¹ logf _n (φ _n )-n ⁻¹ log P (X _n >φ _n )=0(1) asn→∞.