An infeasible-interior-point potential-reduction algorithm for linear programming

n . The method is based on Rockafellar’s proximal point algorithm and a cutting-plane technique. At each step, we use an approximate proximal point p^a(x_k) of x_k to define a v_k∈∂_εkf(p^a(x_k)) with ε_k≤α∥v_k∥, where α is a constant. The method monitors the reduction in the value of ∥v_k∥ to identify when a line search on f should be used. The quasi-Newton step is used to reduce the value of ∥v_k∥. Without the differentiability of f, the method converges globally and the rate of convergence is Q-linear. Superlinear convergence is also discussed to extend the characterization result of Dennis and Moré. Numerical results show the good performance of the method. Received October 3, 1995 / Revised version received August 20, 1998 Published online January 20, 1999     

Fourier Analysis of Semistable Distributions

We consider the generalized convolution powers G _α ^*u (x) of an arbitrary semistable distribution function G _α (x) of exponent α∈(0,2), and prove that for all j, k∈{0,1,2,…} and u>0 the derivatives G _α ^(k,j)(x;u)=∂ ^k+j G _α ^*u (x)/∂ x ^k ∂ u ^j , x∈ℝ, are of bounded variation on the whole real line ℝ. The proof, along with an integral recursion in j, is new even in the special case of stable laws, and the result provides a framework for possible asymptotic expansions in merge theorems from the domain of geometric partial attraction of semistable laws. An erratum to this article can be found at     

Spot Self-Replication and Dynamics for the Schnakenburg Model in a Two-Dimensional Domain

The dynamical behavior of multi-spot solutions in a two-dimensional domain Ω is analyzed for the two-component Schnakenburg reaction–diffusion model in the singularly perturbed limit of small diffusivity ε for one of the two components. In the limit ε→0, a quasi-equilibrium spot pattern in the region away from the spots is constructed by representing each localized spot as a logarithmic singularity of unknown strength S _j for j=1,…,K at unknown spot locations x _j ∈Ω for j=1,…,K. A formal asymptotic analysis, which has the effect of summing infinite logarithmic series in powers of −1/log ε, is then used to derive an ODE differential algebraic system (DAE) for the collective coordinates S _j and x _j for j=1,…,K, which characterizes the slow dynamics of a spot pattern. This DAE system involves the Neumann Green’s function for the Laplacian. By numerically examining the stability thresholds for a single spot solution, a specific criterion in terms of the source strengths S _j , for j=1,…,K, is then formulated to theoretically predict the initiation of a spot-splitting event. The analytical theory is illustrated for spot patterns in the unit disk and the unit square, and is compared with full numerical results computed directly from the Schnakenburg model.      

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.      

Positive linear operators generated by analytic functions

Let φ be a power series with positive Taylor coefficients {a _k } _k=0^∞ and non-zero radius of convergence r ≤ ∞. Let ξ _x , 0 ≤ x < r be a random variable whose values α _k , k = 0, 1, …, are independent of x and taken with probabilities a _k x ^k /φ(x), k = 0, 1, …. The positive linear operator (A _φ f)(x):= E[f(ξ _x )] is studied. It is proved that if E(ξ _x ) = x, E(ξ _x ²) = qx ² + bx + c, q, b, c ∈ R, q > 0, then A _φ reduces to the Szász-Mirakyan operator in the case q = 1, to the limit q-Bernstein operator in the case 0 < q < 1, and to a modification of the Lupaş operator in the case q > 1.     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

Inverse problems for Sturm—Liouville operators with potentials in Sobolev spaces: Uniform stability

Two inverse problems for the Sturm-Liouville operator Ly = s-y″ + q(x)y on the interval [0, fy] are studied. For θ ⩾ 0, there is a mapping F:W ₂^θ → l _B ^θ, F(σ) = {s _k }₁^∞, related to the first of these problems, where W ₂^∞ = W ₂^∞[0, π] is the Sobolev space, σ = ∫ q is a primitive of the potential q, and l _B ^θ is a specially constructed finite-dimensional extension of the weighted space l ₂^θ, where we place the regularized spectral data s = {s _k }₁^∞ in the problem of reconstruction from two spectra. The main result is uniform lower and upper bounds for ∥σ - σ₁∥_θ via the l _B ^θ-norm ∥s − s₁∥_θ of the difference of regularized spectral data. A similar result is obtained for the second inverse problem, that is, the problem of reconstructing the potential from the spectral function of the operator L generated by the Dirichlet boundary conditions. The result is new even for the classical case q ∈ L ₂, which corresponds to θ = 1.     

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

The Gleason’s problem for some polyharmonic and hyperbolic harmonic function spaces

Let Ω ⊆ ℝⁿ be a bounded convex domain with C ² boundary. For 0 < p, q ⩽ ∞ and a normal weight φ, the mixed norm space H _k ^p,q,φ (Ω) consists of all polyharmonic functions f of order k for which the mixed norm ∥ · ∥_p,q,φ < ∞. In this paper, we prove that the Gleason’s problem (Ω, a, H _k ^p,q,φ ) is always solvable for any reference point a ∈ Ω. Also, the Gleason’s problem for the polyharmonic φ-Bloch (little φ-Bloch) space is solvable. The parallel results for the hyperbolic harmonic mixed norm space are obtained.     

L p − Lq estimates for convolution operators with n-Dimensional singular measures

Let S ⊂ ℜⁿ⁺¹ be the graph of the function ϕ :[−1, 1] ⁿ → ℜ defined by ϕ (x ₁ , …, x_n) = ∑ _j=1 ⁿ |x_j|^αj, with1<α ₁ ≤ … ≤ α_n, let σ the Euclidean area measure on S. In this article we study the L^p − L^q boundedness of convolution operators with the singular Borel measure on Rⁿ⁺¹ given by μ (E)=σ (E ∩ S)     

Convergence of the iteration of Halley’s family and Smale operator class in Banach space

Smale operator classes of any order for nonlinear operators in Banach space are introduced. For an operatorf in Smale operator class of orderk, a proper condition for the convergence and the exact estimations error for the iteration of Halley’s family {H _j,k ⁿ } _n=0 ^∞ (1≤j≤k) are given. This Halley’s family is a higher order explicit generalization of Newton iteration. Project supported by China State Major Key Project for Basic Research and Zhejiang Provincial Natrural Science Foundation.     

Regression of polynomial statistics on the sample mean and natural exponential families

A polynomial Q = Q(X ₁, …, X _n ) of degree m in independent identically distributed random variables with distribution function F is an unbiased estimator of a functional q(α ₁(F), …, α _m (F)), where q(u ₁, …, u _m ) is a polynomial in u ₁, …, u _m and α _j (F) is the jth moment of F (assuming the necessary moment of F exists). It is shown that the relation E(Q | X ₁ + … + X n) = 0 holds if and only if q(α ₁(θ), …, α _m (θ)) ≡ 0, where α _j (θ) is the jth moment of the natural exponential family generated by F. This result, based on the fact that X ₁ + … + X n is a complete sufficient statistic for a parameter θ in a sample from a natural exponential family of distributions F _θ(x) = ∫_−∞ ^x e ^θu−k(θ) dF(u), explains why the distributions appearing as solutions of regression problems are the same as solutions of problems for natural exponential families though, at the first glance, the latter seem unrelated to the former.     

Extremal probabilities for Gaussian quadratic forms

 Denote by Q an arbitrary positive semidefinite quadratic form in centered Gaussian random variables such that E(Q)=1. We prove that for an arbitrary x>0, inf _Q P(Q≤x)=P(χ² _n /n≤x), where χ _n ² is a chi-square distributed rv with n=n(x) degrees of freedom, n(x) is a non-increasing function of x, n=1 iff x>x(1)=1.5364…, n=2 iff x[x(2),x(1)], where x(2)=1.2989…, etc., n(x)≤rank(Q). A similar statement is not true for the supremum: if 1<x<2 and Z ₁ ,Z ₂ are independent standard Gaussian rv's, then sup_0≤λ≤1/2 P{λZ ₁ ² +(1−λ)Z ₂ ² ≤x} is taken not at λ=0 or at λ=1/2 but at 0<λ=λ(x)<1/2, where λ(x) is a continuous, increasing function from λ(1)=0 to λ(2)=1/2, e.g. λ(1.5)=.15…. Applications of our theorems include asymptotic quantiles of U and V-statistics, signal detection, and stochastic orderings of integrals of squared Gaussian processes. Received: 24 June 2002 / Revised version: 26 January 2003 Published online: 15 April 2003 Research supported by NSA Grant MDA904-02-1-0091 Mathematics Subject Classification (2000): Primary 60E15, 60G15; Secondary 62G10     

On statistical properties of finite continued fractions

Statistical properties of continued fractions for numbers a/b, where a and b lie in the sector a, b ≥ 1, a² + b² ≤ R², are studied. The main result is an asymptotic formula with two meaning terms for the quantity

On the replications of certain multiplicative designs

Bounds on the number of row sums in ann×n, non-singular (0,1)-matrixA sarisfyingA ^tA=diag (k ₁-λ₁,…,k _n-λ_n),k _j>λ_j>0,λ₁=…=λ_e,λ_e+1=…=λ_n are obtained which extend previous results for such matrices.     

A decomposition property of polyhedra

A polyhedronP = {x∈ ℝ ₊ ⁿ ∣d ⩽Ax ⩽e} is said to have the real decomposition property (RDP) if for any positiveT and any realx∈TP, there are positive coefficients λ₁,…, λ _r and integers ¹, …,s ^r ∈P withx = λ _l s ^l + … + λ _r s ^r andT=λ _l + ⋯ + λ _r . We give a constructive proof that this property holds for a polyhedronP iffP is integral. This construction is used to show that some classes of polyhedra have an integral decomposition property. Furthemore, the RDP provides a generalization of the theorem of Birkhoff-von Neumann. So RDP may be used in some scheduling problems on parallel processors with preemptions.     

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

A variant of Davenport’s constant

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of ]n[≔ {1, 2,…, n} such that elements of A are incongruent modulo p and non-zero modulo p. Let k ≥ D(G/|A| be any integer where D(G) denotes the well-known Davenport’s constant. In this article, we prove that for any sequence g ₁, g ₂,…, g _k (not necessarily distinct) in G, one can always extract a subsequence with 1 ≤ ℓ ≤ k such that

An application of ergodic theory to a problem in geometric ramsey theory

LetE be a measurable subset of ℝ ^k ,k>2, with XXX(E)>0. LetV = {0,υ ₁, …,υ _k+1} ε ℝ ^k , whereυ ₁, …,υ _k+1 are affinely independent. We show that forr large enough, we can find an isometric copy ofrV arbitrarily close toE. This is a generalization of a theorem of Furstenberg, Katznelson and Weiss [FKW] showing a similar property for ℝ²,V = {0,υ ₁,υ ₂}.     

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999