The “Full Müntz Theorem” inL p[0, 1] for 0<p<∞

Denote by span {f ₁,f ₂, …} the collection of all finite linear combinations of the functionsf ₁,f ₂, … over ?. The principal result of the paper is the following. Theorem (Full Müntz Theorem in L_p(A) for p ∈ (0, ∞) and for compact sets A ? [0, 1] with positive lower density at 0). Let A ? [0, 1] be a compact set with positive lower density at 0. Let p ∈ (0, ∞). Suppose (λ _j ) _j=1 ^∞ is a sequence of distinct real numbers greater than ?(1/p). Then span {x ^λ1,x ^λ2,…} is dense in L_p(A) if and only if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ . Moreover, if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ , then every function from the L_p(A) closure of {x ^λ1,x ^λ2,…} can be represented as an analytic function on {z ∈ ? \ (?∞,0] : |z| < r_A} restricted to A ∩ (0, r_A) where $r_A : = \sup \left\{ {y \in \mathbb{R}:\backslash ( - \infty ,0]:\left| z \right|< r_A } \right\}$ (m(·) denotes the one-dimensional Lebesgue measure). This improves and extends earlier results of Müntz, Szász, Clarkson, Erdös, P. Borwein, Erdélyi, and Operstein. Related issues about the denseness of {x ^λ1,x ^λ2,…} are also considered.     

Faster least squares approximation

Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets n be the number of constraints and d be the number of variables, with n >> d{n \gg d}. Then, existing exact methods find a solution vector in O(nd ²) time. We present two randomized algorithms that provide accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the Randomized Hadamard transform. One then uniformly randomly samples constraints and solves the smaller problem on those constraints, and the other performs a sparse random projection and solves the smaller problem on those projected coordinates. In both cases, solving the smaller problem provides relative-error approximations, and, if n is sufficiently larger than d, the approximate solution can be computed in O(nd ln d) time.     

A note on harmonic forms on complete manifolds

In this note, we will prove that under certain conditions, the space of polynomial growth harmonic functions and harmonic forms with a fixed growth rate on manifolds which are asymptotically nonnegatively curved is finite dimensional. This is a partial generalization of the works of Li and Colding-Minicozzi. We will also give an explicit estimate for the dimension in case the manifold is a complete surface of finite total curvature. This is a generalization to harmonic forms of the work of Li and the author.

     

On the elliptic equation on complete Riemannian manifolds and their geometric applications

We study the elliptic equation on complete noncompact Riemannian manifolds with nonnegative. Three fundamental theorems for this equation are proved in this paper. Complete analyses of this equation on the Euclidean space and the hyperbolic space are carried out when is a constant. Its application to the problem of conformal deformation of nonpositive scalar curvature will be done in the second part of this paper.

     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.     

（Ω,Aab）场论中测地线的进动

本文的目的在于推算余桑提出的（Ω，Ａ＿（ａｂ））场论￣［１］中测地线的进动。并将所得结果与Ｓｃｈｗａｒ－ｚｓｅｈｉｌｄ轨道作了比较。     

Strongly essential coalitions and the nucleolus of peer group games

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class belong to a prespecified collection of size polynomial in the number of players. We consider a subclass of essential coalitions, called strongly essential coalitions, and show that in any game, the collection of strongly essential coalitions contains all the coalitions which actually determine the core, and in case the core is not empty, the nucleolus and the kernelcore. As an application, we consider peer group games, and show that they admit at most 2n−1 strongly essential coalitions, whereas the number of essential coalitions could be as much as 2ⁿ⁻¹. We propose an algorithm that computes the nucleolus of an n-player peer group game in time directly from the data of the underlying peer group situation.Research supported in part by OTKA grant T030945. The authors thank a referee and the editor for their suggestions on how to improve the presentation     

On the Optimal Value Function of a Linearly Perturbed Quadratic Program

The optimal value function of the quadratic program , where is a given symmetric matrix, a given matrix, and are the linear perturbations, is considered. It is proved that is directionally differentiable at any point in its effective domain . Formulae for computing the directional derivative of at in a direction are obtained. We also present an example showing that, in general, is not piecewise linear-quadratic on W. The preceding (unpublished) example of Klatte is also discussed.