Estimates of the dilatation function of Beurling-Ahlfors extension

In this paper we estimate the dilatation function of the Beurling-Ahlfors extension in the most general case. By introducing ?h,m-function, we obtain an inequality which is sharp up to a constant.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

An improved randomized approximation algorithm for maximum triangle packing

This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expected ratio of for any constant ?>0. By modifying their algorithm, we obtain a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio of 0.5257(1−?) for any constant ?>0.     

Iterative approximation of a zero of accretive operator in Banach space

This paper introduces an iteration scheme for viscosity approximation of a zero of accretive operator in a reflexive Banach space with weakly continuous duality mapping. A new iterative sequence is introduced and strong convergence of the algorithm {x_n} is proved. The results improve and extend the results of Su [Xiaolong Qin, Yongfu Su, Approximation of a zero point of accretive operator in Banach spaces, J. Math. Anal. Appl. 320 (2007) 415-424] and some others.     

A short note on the overpartition function

In this brief note, we give a combinatorial proof of a variation of Gauss’s q-binomial theorem, and we determine arithmetic properties of the overpartition function modulo 8.     

On the approximation of spectra of linear operators on Hilbert spaces

We present several new techniques for approximating spectra of linear operators (not necessarily bounded) on an infinite-dimensional, separable Hilbert space. Our approach is to take well-known techniques from finite-dimensional matrix analysis and show how they can be generalized to an infinite-dimensional setting to provide approximations of spectra of elements in a large class of operators. We conclude by proposing a solution to the general problem of approximating the spectrum of an arbitrary bounded operator by introducing the n-pseudospectrum and argue how that can be used as an approximation to the spectrum.     

Sample-based polynomial approximation of rational Bézier curves

We present an iteration method for the polynomial approximation of rational Bézier curves. Starting with an initial Bézier curve, we adjust its control points gradually by the scheme of weighted progressive iteration approximations. The L_p-error calculated by the trapezoidal rule using sampled points is used to guide the iteration approximation. We reduce the L_p-error by a predefined factor at every iteration so as to obtain the best approximation with a minimum error. Numerical examples demonstrate the fast convergence of our method and indicate that results obtained using the L₁-error criterion are better than those obtained using the L₂-error and L_∞-error criteria.     

Remark on uniqueness of mild solutions to the Navier-Stokes equations

We investigate a limiting uniqueness criterion to the Navier-Stokes equations. We prove that the mild solution is unique under the class , where bmo^-1 is the “critical” space including Lⁿ. As an application of uniqueness theorem, we also consider the local well-posedness of Navier-Stokes equations in bmo^-1.     

Waiting times in queues with relative priorities

This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter.     

A note on the rank parity function

We provide some further theorems on the partitions generated by the rank parity function. New Bailey pairs are established, which are of independent interest.     

Convergence of a stochastic particle approximation for fractional scalar conservation laws

We are interested in a probabilistic approximation of the solution to scalar conservation laws with fractional diffusion and nonlinear drift. The probabilistic interpretation of this equation is based on a stochastic differential equation driven by an α-stable Lévy process and involving a nonlinear drift. The approximation is constructed using a system of particles following a time-discretized version of this stochastic differential equation, with nonlinearity replaced by interaction. We prove convergence of the particle approximation to the solution of the conservation law as the number of particles tends to infinity whereas the discretization step tends to 0 in some precise asymptotics.     

Colorings of k-balanced matrices and integer decomposition property of related polyhedra

We show that a class of polyhedra, arising from certain 0,1 matrices introduced by Truemper and Chandrasekaran, has the integer decomposition property. This is accomplished by proving certain coloring properties of these matrices.     

Absolutely convergent Fourier series and function classes

We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs either to one of the Lipschitz classes Lip(α) and lip(α) for some 0<α?1, or to one of the Zygmund classes Λ_∗(1) and λ_∗(1). Our theorems generalize some of those by Boas [R.P. Boas Jr., Fourier series with positive coefficients, J. Math. Anal. Appl. 17 (1967) 463-483] and one by Németh [J. Németh, Fourier series with positive coefficients and generalized Lipschitz classes, Acta Sci. Math. (Szeged) 54 (1990) 291-304]. We also prove a localized version of a theorem by Paley [R.E.A.C. Paley, On Fourier series with positive coefficients, J. London Math. Soc. 7 (1932) 205-208] on the existence and continuity of the derivative of f.     

Hardness of lazy packing and covering

We prove APX-hardness for the two problems maximum resource bin packing and lazy bin covering. Simple algorithms matching the best absolute bounds under the assumption P≠NP are also derived.     

Conservation laws for some compacton equations using the multiplier approach

This paper is an application of the variational derivative method to the derivation of the conservation laws for partial differential equations. The conservation laws for (1+1) dimensional compacton k(2,2) and compacton k(3,3) equations are studied via multiplier approach. Also the conservation laws for (2+1) dimensional compacton Zk(2,2) equation are established by first computing the multipliers.     

Convergence of SSOR methods for linear complementarity problems

In this paper, by applying the SSOR splitting, we propose two new iterative methods for solving the linear complementarity problem LCP (M,q). Convergence results for these two methods are presented when M is an H-matrix (and also an M-matrix). Finally, two numerical examples are given to show the efficiency of the presented methods.     

Least squares estimators of the regression function with twice censored data

We propose least squares estimators of E(Y/X=x) for Y censored on the right by R and min(Y,R) left censored. We establish their convergence in the L₂-norm. This work extends a known result in the context of right censoring.     

Multicyclicity of unbounded normal operators and polynomial approximation in C

A remarkable and much cited result of Bram [J. Bram, Subnormal operators, Duke Math. J. 22 (1955) 75-94] shows that a star-cyclic bounded normal operator in a separable Hilbert space has a cyclic vector. If, in addition, the operator is multiplication by the variable in a space L²(m) (not only unitarily equivalent to it), then it has a cyclic vector in L^∞(m). We extend Bram's result to the case of a general unbounded normal operator, implying by this that the (classical) multiplicity and the multicyclicity of the operator (cf. [N.K. Nikolski, Operators, Functions and Systems: An Easy Reading, vol. 2, Math. Surveys Monogr., vol. 93, Amer. Math. Soc., Providence, 2002]) coincide. It follows that if m is a sigma-finite Borel measure on C (possibly with noncompact support), then there is a nonnegative finite Borel measure τ equivalent to m and such that L²(C,τ) is the norm-closure of the polynomials in z.     

Rough approximations of vague sets in fuzzy approximation space

The combination of the rough set theory, vague set theory and fuzzy set theory is a novel research direction in dealing with incomplete and imprecise information. This paper mainly concerns the problem of how to construct rough approximations of a vague set in fuzzy approximation space. Firstly, the β-operator and its complement operator are introduced, and some new properties are examined. Secondly, the approximation operators are constructed based on β-(complement) operator. Meantime, λ-lower (upper) approximation is firstly proposed, and then some properties of two types of approximation operators are studied. Afterwards, for two different kinds of approximation operators, we introduce two roughness measure methods of the same vague set and discuss a property. Finally, an example is given to illustrate how to calculate the rough approximations and roughness measure of a vague set using the β-(complement) product between two fuzzy matrixes. The results show that the proposed rough approximations and roughness measure of a vague set in fuzzy environment are reasonable.     

Further improved recursions for a class of compound Poisson distributions

In the present paper we develop more efficient recursive formulae for the evaluation of the t-order cumulative function Γ^th(x) and the t-order tail probability Λ^th(x) of the class of compound Poisson distributions in the case where the derivative of the probability generating function of the claim amounts can be written as a ratio of two polynomials. These efficient recursions can be applied for the exact evaluation of the probability function (given by De Pril [De Pril, N., 1986a. Improved recursions for some compound Poisson distributions. Insurance Math. Econom. 5, 129-132]), distribution function, tail probability, stop-loss premiums and t-order moments of stop-loss transforms of compound Poisson distributions. Also, efficient recursive algorithms are given for the evaluation of higher-order moments and r-order factorial moments about any point for this class of compound Poisson distributions. Finally, several examples of discrete claim size distributions belonging to this class are also given.