The generalized relaxed proximal point algorithm involving -maximal-relaxed accretive mappings with applications to Banach spaces

A general design for the relaxed proximal point algorithm using the notion of A-maximal-relaxed accretiveness is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion problems is examined along with some other results of interest involving A-maximal-relaxed accretive mappings in a real Banach space setting.     

Gradient estimates and Jackson’s theorem in spaces related to measures

Jackson’s theorem is established in a new kind of holomorphic function space Q_μ related to measures in any starlike circular domain in . Particularly, the result covers many spaces including BMOA, Q_p, Q_K, and F(p,q,s) spaces in the unit ball of . Moreover, we construct integral operators which give pointwise estimates for the gradient of the difference in terms of the gradient on the boundary. The gradient estimates are independent of the measures in question and give rise to Jackson’s theorem.     

A hybrid approximation method for equilibrium and fixed point problems for a family of infinitely nonexpansive mappings and a monotone mapping

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a family of infinitely nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in the framework of a Hilbert space. Under suitable conditions, some strong convergence theorems for approximating a common element of the above three sets are obtained. Additionally, we utilize our results to study the optimization problem and find a zero of a maximal monotone operator and a strictly pseudocontractive mapping in a real Hilbert space. Our results improve and extend the results announced by many others.     

An extension of the Wang transform derived from Bühlmann’s economic premium principle for insurance risk

It is well known that the Wang transform [Wang, S.S., 2002. A universal framework for pricing financial and insurance risks. Astin Bull. 32, 213–234] for the pricing of financial and insurance risks is derived from Bühlmann’s economic premium principle [Bühlmann, H., 1980. An economic premium principle. Astin Bull. 11, 52–60]. The transform is extended to the multivariate setting by [Kijima M., 2006. A multivariate extension of equilibrium pricing transforms: The multivariate Esscher and Wang transforms for pricing financial and insurance risks, Astin Bull. 36, 269–283]. This paper further extends the results to derive a class of probability transforms that are consistent with Bühlmann’s pricing formula. The class of transforms is extended to the multivariate setting by using a Gaussian copula, while the multiperiod extension is also possible within the equilibrium pricing framework.     

A quantitative version of Trotter's approximation theorem

A quantitative version, based on modified K-functionals, of the classical Trotter's theorem concerning the approximation of C₀-semigroups is presented. The result is applied to the study of the degree of convergence of the iterated Bernstein operators on the N-dimensional simplex to their limiting semigroup.     

The fixed point property in -triples and preduals of -triples

We prove that for every member X in the class of real or complex JB^*-triples or preduals of JBW^*-triples, the following assertions are equivalent:

(1) X has the fixed point property.

(2) X has the super fixed point property.

(3) X has normal structure.

(4) X has uniform normal structure.

(5) The Banach space of X is reflexive.

As a consequence, a real or complex C^*-algebra or the predual of a real or complex W^*-algebra having the fixed point property must be finite-dimensional.

Faulhaber’s theorem on power sums

We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a+b,a+2b,…,a+nb is a polynomial in na+n(n+1)b/2. While this assertion can be deduced from the original Fauhalber’s theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, by utilizing the central factorial numbers as in the approach of Knuth, we derive formulas for r-fold sums of powers without resorting to the notion of r-reflective functions. We also provide formulas for the r-fold alternating sums of powers in terms of Euler polynomials.     

Three solutions for a differential inclusion problem involving the -Laplacian

In this paper we consider differential inclusion problem involving the p(x)-Laplacian of the type

Applying a version of the non-smooth three-critical-points theorem we obtain the existence of three solutions of the problem in .     

A new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings

In this paper, we introduce a new iterative scheme for finding the common element of the set of common fixed points of infinitely many nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in Hilbert spaces. We prove that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. This main result improve and extend Plubtieng and Punpaeng’s corresponding result [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Applied Mathematics and Computation 197 (2008), 548–558]. Using this theorem, we obtain three corollaries.     

Turán’s theorem inverted

In this note we complete an investigation started by Erd?s in 1963 that aims to find the strongest possible conclusion from the hypothesis of Turán’s theorem in extremal graph theory.Let be the complete r-partite graph with parts of sizes s₁≥2,s₂,…,s_r with an edge added to the first part. Letting t_r(n) be the number of edges of the r-partite Turán graph of order n, we prove that:For all r≥2 and all sufficiently small c>0, every graph of sufficiently large order n with t_r(n)+1 edges contains a .We also give a corresponding stability theorem and two supporting results of wider scope.     

Travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov () system

In this paper, travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov system (called D(m,n) system) are studied by using the Weierstrass elliptic function method. As a result, more new exact travelling wave solutions to the D(m,n) system are obtained including not only all the known solutions found by Xie and Yan but also other more general solutions for different parameters m,n. Moreover, it is also shown that the D(m,1) system with linear dispersion possess compacton and solitary pattern solutions. Besides that, it should be pointed out that the approach is direct and easily carried out without the aid of mathematical software if compared with other traditional methods. We believe that the method can be widely applied to other similar types of nonlinear partial differential equations (PDEs) or systems in mathematical physics.     

Infinitely many non-negative solutions for a Dirichlet problem involving -Laplacian

In this paper, we consider a Dirichlet problem involving the p(x)-Laplacian of the type

We prove the existence of infinitely many non-negative solutions of the problem by applying a general variational principle due to B. Ricceri and the theory of the variable exponent Sobolev spaces.     

Central limit theorem and the bootstrap for -statistics of strongly mixing data

The asymptotic normality of U-statistics has so far been proved for iid data and under various mixing conditions such as absolute regularity, but not for strong mixing. We use a coupling technique introduced in 1983 by Bradley [R.C. Bradley, Approximation theorems for strongly mixing random variables, Michigan Math. J. 30 (1983),69–81] to prove a new generalized covariance inequality similar to Yoshihara’s [K. Yoshihara, Limiting behavior of U-statistics for stationary, absolutely regular processes, Z. Wahrsch. Verw. Gebiete 35 (1976), 237–252]. It follows from the Hoeffding-decomposition and this inequality that U-statistics of strongly mixing observations converge to a normal limit if the kernel of the U-statistic fulfills some moment and continuity conditions.The validity of the bootstrap for U-statistics has until now only been established in the case of iid data (see [P.J. Bickel, D.A. Freedman, Some asymptotic theory for the bootstrap, Ann. Statist. 9 (1981), 1196–1217]. For mixing data, Politis and Romano [D.N. Politis, J.P. Romano, A circular block resampling procedure for stationary data, in: R. Lepage, L. Billard (Eds.), Exploring the Limits of Bootstrap, Wiley, New York, 1992, pp. 263–270] proposed the circular block bootstrap, which leads to a consistent estimation of the sample mean’s distribution. We extend these results to U-statistics of weakly dependent data and prove a CLT for the circular block bootstrap version of U-statistics under absolute regularity and strong mixing. We also calculate a rate of convergence for the bootstrap variance estimator of a U-statistic and give some simulation results.     

Fixed point theorems for nonexpansive mappings and Suzuki-generalized nonexpansive mappings on a Banach lattice

We prove the existence of fixed points for multivalued nonexpansive nonself-mappings on a weakly orthogonal reflexive Banach lattice with uniformly monotone norm. Moreover, for single-valued mappings, we extend Betiuk-Pilarska and Prus’s result [A. Betiuk-Pilarska, S. Prus, Banach lattices which are order uniformly noncreasy, J. Math. Anal. Appl. 342 (2008) 1271–1279] on the weak fixed point property to continuous mappings satisfying condition (C) on a w-weakly orthogonal OUNC Banach lattice.     

Über ein Turánsches problem für radiale, positiv definite Funktionen, II

Turán's problem is to determine the greatest possible value of the integral for positive definite functions f(x), , supported in a given convex centrally symmetric body , . We consider the problem for positive definite functions of the form f(x)=(x₁), , with supported in [0,π], extending results of our first paper from two to arbitrary dimensions.Our two papers were motivated by investigations of Professor Y. Xu and the 2nd named author on, what they called, ℓ-1 summability of the inverse Fourier integral on . Their investigations gave rise to a pair of transformations (h_d,m_d) on which they studied using special functions, in particular spherical Bessel functions.To study the d-dimensional Turán problem, we had to extend relevant results of B. & X., and we did so using again Bessel functions. These extentions seem to us to be equally interesting as the application to Turán's problem.     

Corrigendum to “Extending homeomorphisms from punctured surfaces to handlebodies” [Topology Appl. 155 (6) (2008) 610–621]

We correct the statements of Theorems 9 and 10 of [A. Cattabriga, M. Mulazzani, Extending homeomorphisms from punctured surfaces to handlebodies, Topology Appl. 155 (2008) 610–621], by adding missing generators, and improve the statement of Theorem 10, by removing some redundant generators.     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

Adaptive thinning algorithm of nonsingular triangulation

This paper studies adaptive thinning strategies for the non-singular triangulation of scattered data by C¹-rational spline function. Given a set of points in R², Luo, Liu and Chen have presented a triangulation algorithm which ensures the non-singularity of and spaces. In this paper, we improve the algorithm to reduce the number of knots of the triangulation within a given tolerance, while the non-singularity of and spaces is ensured. Our strategies presented here depend on both the locations of the data points in the plane, and the data values at these points. We give the definition of discrete norm for C¹-rational spline function by using its coefficients. Then a weight is assigned to each knot, which is a measure of the importance of knot in the representation of spline. When the weight of the knot is less than the given tolerance, its influence is regarded negligible, then it can be removed. It’s a discrete method. In the end of this paper several numerical examples are presented to show the feasibility and validity of our algorithm.