LP（Rn）-Boundedness of certain commutators

In this paper, the Lp(Rn)-boundedness of the commutators generalized by BMO(Rn) function and the singular integral operator T with rough kernel Ω∈ Llog+ L(Sn-1) is proved by using the Bony's formula for the paraproduct of two functions.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> Extemal Polynomials Associated with Generalized Jacobi Weights

Asymptotic estimations of the Christoffel type functions for Lm extremal polynomials with an even integer m associated with generalized Jacobi weights are established. Also, asymptotic behavior of the zeros of the Lm extremal polynomials and the Cotes numbers of the corresponding Turan quadrature formula is given.     

The Cauchy Boundary Value Problems on Closed Piecewise Smooth Manifolds in <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Suppose that D is a bounded domain with a piecewise C^1 smooth boundary in C^n. Let ψ∈C^1 α(δD). By using the Hadamard principal value of the higher order singular integral and solid angle coefficient method of points on the boundary, we give the Plemelj formula of the higher order singular integral with the Boehner-Martinelli kernel, which has integral density ψ. Moreover, by means of the Plemelj formula and methods of complex partial differential equations, we discuss the corresponding Cauehy boundary value problem with the Boehner-Martinelli kernel on a closed piecewise smooth manifold and obtain its unique branch complex harmonic solution.     

Remarks on the <Emphasis Type="Italic">k</Emphasis>-error linear complexity of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>-periodic sequences

Recently the first author presented exact formulas for the number of 2 ⁿ -periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2 ⁿ -periodic binary sequence. A crucial role for the analysis played the Chan–Games algorithm. We use a more sophisticated generalization of the Chan–Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p ⁿ -periodic sequences over prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p ⁿ -periodic sequences over .      

The best quadrature formula based on Hermite information for the class KW~2[a,b]

The best quadrature formula has been found in the following sense:for afunction whose norm of the second derivative is bounded by a given constant and thebest quadrature formula for the approximate evaluation of integration of that function canminimize the worst possible error if the values of the function and its derivative at certainnodes are known.The best interpolation formula used to get the quadrature formula aboveis also found.Moreover,we compare the best quadrature formula with the open compoundcorrected trapezoidal formula by theoretical analysis and stochastic experiments.     

<Emphasis Type="Italic">W</Emphasis><Superscript>1,<Emphasis Type="Italic">p</Emphasis></Superscript>(R<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)-boundedness for maximal functions

In this paper, we get W ^1,p (R ⁿ )-boundedness for tangential maximal function and nontangential maximal function, which improves J.Kinnunen, P.Lindqvist and Tananka’s results. Supported by the key Academic Discipline of Zhejiang Province of China under Grant No.2005 and the Zhejiang Provincial Natural Science Foundation of China.     

SOME RESULTS ABOUT BEST COAPPROXIMATION IN L^P（S,X）

As a counterpart to best approximation in normed linear spaces, the best coapproximation was introduced by Franchetti and Furi. In this paper, we shall consider the relation between coproximinality M in X and L ^p (S,M) in L ^p (S,X). Finally we give some results in cochebyshev subspaces and additional subspaces.     

The Uniform <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> Behavior for Time Discretization of an Evolution Equation

The uniform L^2 stability and convergence properties for the time discretization of an evolution equation with a memory term are studied.The methods are based on the second-order backward difference methods.The memory term is approximated by the second-order convolution quadrature and interpolant quadrature.     

Rate of convergence to stationarity of the system <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">N</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">R</Emphasis>

We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N.     

Summability Kernels for <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> Multipliers

In this article we study the problem of extending Fourier Multipliers on L ^p (T) to those on L ^p (R) by taking convolution with a kernel, called a summability kernel. We characterize the space of such kernels for the cases p = 1 and p = 2. For other values of p we give a necessary condition for a function to be a summability kernel. For the case p = 1, we present properties of measures which are transferred from M(T) to M(R) by summability kernels. Furthermore it is shown that every l _p sequence can be extended to some L ^q (R) multipliers for certain values of p and q.     

Further Results for the Queueing System <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis>

For the multi-channel bulk-arrival queue, M ^x /M/c, Abol'nikov and Kabak independently obtained steady state results. In this paper the results of these authors are extended, corrected and simplified. A number of measures of efficiency are calculated for three cases where the arrival group size has: (i) a constant value, (ii) a geometric distribution, or (iii) a positive Poisson distribution. The paper also shows how to calculate fractiles for both the queue length and the waiting time distribution. Examples of extensive numerical results for certain measures of efficiency are presented in tabular and chart form.     

On the product formulas for <Emphasis Type="Italic">C</Emphasis>-semigroups

In this paper we obtain a Chernoff-type approximation theorem for C-semigroups, from which we derive the Trotter product formula and the Post-Widder inversion formula for C-semigroups. The first author was supported by the NSF of China (Grant No. 10501032) and the NSFC-RFBR Programm (Grant No. 108011120015), and the second author by the NSF of China (Grant No. 10671079).     

On the <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-consistency of wavelet estimators

This paper deals with the L ^p -consistency of wavelet estimators for a density function based on size-biased random samples. More precisely, we firstly show the L ^p -consistency of wavelet estimators for independent and identically distributed random vectors in R ^d . Then a similar result is obtained for negatively associated samples under the additional assumptions d = 1 and the monotonicity of the weight function.     

On the Schlafli differential formula based on edge lengths of tetrahedron in <Emphasis Type="Italic">H</Emphasis><Superscript>3</Superscript> and <Emphasis Type="Italic">S</Emphasis><Superscript>3</Superscript>

We obtain a new version of Schlafli differential formula based on edge lengths for the volume of a tetrahedron in hyperbolic and spherical 3-spaces, by using the edge matrix of a hyperbolic(or spherical) tetrahedron and its submatrix.      

Smooth noncompact operators from <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>), <Emphasis Type="Italic">K</Emphasis> scattered

Let X be a Banach space, K be a scattered compact and T: B _C(K) → X be a Fréchet smooth operator whose derivative is uniformly continuous. We introduce the smooth biconjugate T**: B _C(K)** → X** and prove that if T is noncompact, then the derivative of T** at some point is a noncompact linear operator. Using this we conclude, among other things, that either is compact or that ℓ₁ is a complemented subspace of X*. We also give some relevant examples of smooth functions and operators, in particular, a C ^1,u -smooth noncompact operator from B _{c O} which does not fix any (affine) basic sequence. P. Hájek was supported by grants A100190502, Institutional Research Plan AV0Z10190503.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

State spaces of <Emphasis Type="Italic">JB</Emphasis><Superscript><Emphasis Type="Italic">*</Emphasis></Superscript>-triples<Superscript>*</Superscript>

An atomic decomposition is proved for Banach spaces which satisfy some affine geometric axioms compatible with notions from the quantum mechanical measuring process. This is then applied to yield, under appropriate assumptions, geometric characterizations, up to isometry, of the unit ball of the dual space of a JB^*-triple, and up to complete isometry, of one-sided ideals in C^*-algebras.Mathematics Subject Classification (2000):17C65, 46L07Both authors are supported by NSF grant DMS-0101153     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> approximation capability of RBF neural networks

L ^p approximation capability of radial basis function (RBF) neural networks is investigated. If g: R ₊¹ → R ¹ and ∈ L _loc ^p (R ⁿ ) with 1 ≤ p < ∞, then the RBF neural networks with g as the activation function can approximate any given function in L ^p (K) with any accuracy for any compact set K in R ⁿ , if and only if g(x) is not an even polynomial. Partly supported by the National Natural Science Foundation of China (10471017)     

Finite termination of a dual Newton method for convex best <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">1</Emphasis></Superscript> interpolation and smoothing

Summary. Given the data (x _i ,y _i )², which are in convex position, the problem is to choose the convex best C ¹ interpolant with the smallest mean square second derivative among all admissible cubic C ¹ -splines on the grid. This problem can be efficiently solved by its dual program, developed by Schmdit and his collaborators in a series of papers. The Newton method remains the core of their suggested numerical scheme. It is observed through numerical experiments that the method terminates in a small number of steps and its total computational complexity is only of O(n). The purpose of this paper is to establish theoretical justification for the Newton method. In fact, we are able to prove its finite termination under a mild condition, and on the other hand, we illustrate that the Newton method may fail if the condition is violated, consistent with what is numerically observed for the Newton method. Corresponding results are also obtained for convex smoothing. Mathematics Subject Classification (2000):41A29, 65D15, 49J52, 90C25The work was supported by the Australian Research Council for the first author and by the Hong Kong Research Grant Council for the second author.     

The Existence of LHMTS(<Emphasis Type="Italic">m</Emphasis><Superscript><Emphasis Type="Italic">v</Emphasis></Superscript>) and LHDTS(<Emphasis Type="Italic">m</Emphasis><Superscript><Emphasis Type="Italic">v</Emphasis></Superscript>)

In this article, we establish the existence of an LHMTS(m^v) for v ≡ 2 (mod 6) and m≡ 3 (mod 6). Thus there exists an LHMTS(m^v) if and only if v(v-1)m² ≡ 0 (mod 3) except possibly for v=6, m≡ 1, 5 (mod 6) and m≠1. In the similar way, the existence of LHDTS(m^v) is completely determined, i.e., there exists an LHDTS(m^v) if and only if v(v-1)m² ≡ 0 (mod 3).