Asymptotic periodicity for some evolution equations in Banach spaces

This work deals with the existence and uniqueness of pseudo-almost periodic and asymptotically ω-periodic mild solutions to some evolution equations in Banach spaces.     

On the convergence of modified Noor iterations with errors for asymptotically nonexpansive mappings

In this paper, several weak and strong convergence theorems are established for a modified Noor iterative scheme with errors for three asymptotically nonexpansive mappings in Banach spaces. Mann-type, Ishikawa-type, and Noor-type iterations are covered by the new iteration scheme. Our results extend and improve the recently announced ones [B.L. Xu, M.A. Noor, Fixed point iterations for asymptotically nonexpansive mappings in Banach spaces, J. Math. Anal. Appl. 267 (2002) 444-453; Y.J. Cho, H. Zhou, G. Guo, Weak and strong convergence theorems for three-step iterations with errors for asymptotically nonexpansive mappings, Comput. Math. Appl. 47 (2004) 707-717] and many others.     

Bounding the size of square-free subgraphs of the hypercube

We investigate the maximum size of a subset of the edges of the n-cube that does not contain a square, or 4-cycle. The size of such a subset is trivially at most 3/4 of the total number of edges, but the proportion was conjectured by Erd?s to be asymptotically 1/2. Following a computer investigation of the 4-cube and the 5-cube, we improve the known upper bound from 0.62284… to 0.62256… in the limit.     

Similarity in soft set theory

We introduce and study the concept of similarity between soft sets, which is an extension of the equality for soft set theory. We also introduce the concepts of conjunction parameter (α∧β) and disjunction parameter (α∨β) of ordered pair parameter 〈α,β〉 for soft set theory, and we investigate modified operations of soft set theory in terms of ordered parameters.     

The inclusion relation between Sobolev and modulation spaces

The inclusion relations between the Lp-Sobolev spaces and the modulation spaces is determined explicitly. As an application, mapping properties of unimodular Fourier multiplier eiα|D| between Lp-Sobolev spaces and modulation spaces are discussed.     

Means in metric spaces and the center of mass

In this article k-convex metric spaces are considered where a several variable mapping is provided as a limit point of an iteration scheme based on the midpoint map in the metric space itself. This mapping, considered as a mean of its variables, has some properties which relates it to the center of mass of these variables in the metric space. Sufficient conditions are given here for the two points to be identical, as well as upper bounds on their distances from one another. The asymptotic rate of convergence of the iterative process defining the mean is also determined here. The case of the symmetric space on the convex cone of positive definite matrices related to the geometric mean and the special orthogonal group are also studied here as examples of k-convex metric spaces.     

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.     

Best simultaneous approximations, asymptotically nonexpansive mappings and variational inequalities in Banach spaces

The existence of common fixed points is established for three mappings where T is either generalized (f,g)-nonexpansive or asymptotically (f,g)-nonexpansive on a nonempty subset of a Banach space. As applications, the invariant best simultaneous approximation results are proved and the existence of solution of variational inequalities is obtained. Our results unify and substantially improve several recent results existing in the current literature.     

Binary relations and reduced hypergroups

Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations ρ and σ on H we investigate when the hypergroups associated with the relations ρ∩σ, ρ∪σ and ρσ are reduced. We also determine when the cartesian product of two hypergroupoids associated with a binary relation is a reduced hypergroup.     

A note on randomized Shepp’s urn scheme

Shepp’s urn model is a useful tool for analyzing the stopping-rule problems in economics and finance. In [R.W. Chen, A. Zame, C.T. Lin, H. Wu, A random version of Shepp’s urn scheme, SIAM J. Discrete Math. 19 (1) (2005) 149-164], Chen et al. considered a random version of Shepp’s urn scheme and showed that a simple drawing policy (called “the k in the hole policy”) can asymptotically maximize the expected value of the game. By extending the work done by Chen et al., this note considers a more general urn scheme that is better suited to real-life price models in which the short-term value might not fluctuate. Further, “the k in the hole policy” is shown to be asymptotically optimal for this new urn scheme.     

Lim's theorems for multivalued mappings in CAT(0) spaces

Let X be a complete CAT(0) space. We prove that, if E is a nonempty bounded closed convex subset of X and a nonexpansive mapping satisfying the weakly inward condition, i.e., there exists p∈E such that ∀x∈E, ∀α∈[0,1], then T has a fixed point. In Banach spaces, this is a result of Lim [On asymptotic centers and fixed points of nonexpansive mappings, Canad. J. Math. 32 (1980) 421-430]. The related result for unbounded R-trees is given.     

On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NP-hard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pairs is fixed, but remains NP-hard in directed acyclic graphs and APX-hard in bounded tree-width and bounded degree unweighted digraphs. The vertex version, although tractable in trees, is proved to be NP-hard in unweighted cacti of bounded degree and bounded path-width.     

Generalized spherical and simplicial coordinates

Elementary trigonometric quantities are defined in l2,p analogously to that in l2,2, the sine and cosine functions are generalized for each p>0 as functions sinp and cosp such that they satisfy the basic equation p|cosp(φ)|+p|sinp(φ)|=1. The p-generalized radius coordinate of a point ξ∈Rn is defined for each p>0 as . On combining these quantities, ln,p-spherical coordinates are defined. It is shown that these coordinates are nearly related to ln,p-simplicial coordinates. The Jacobians of these generalized coordinate transformations are derived. Applications and interpretations from analysis deal especially with the definition of a generalized surface content on ln,p-spheres which is nearly related to a modified co-area formula and an extension of Cavalieri's and Torricelli's indivisibeln method, and with differential equations. Applications from probability theory deal especially with a geometric interpretation of the uniform probability distribution on the ln,p-sphere and with the derivation of certain generalized statistical distributions.     

Determining tension parameters in rational gamma-spline interpolation

Inspired by the classic γ-spline, we propose a method for constructing a G² rational γ-spline curve that interpolates a given set of distinct ordered data-points (planar or spatial). The only input of our method is just these data-points. We also present a procedure to solve the key problem of determining the tension parameters γ_i which are computed in terms of exponential functions that determine the eccentricities of the common conic osculants at the junction points while keeping in geometrical agreement with data-points. This allows the resulting curve to be modified in the close vicinity of each data-point.     

Multiple positive solutions for a critical quasilinear elliptic system

The existence of cat_Ω(Ω) positive solutions for the p-Laplacian system with convex and Sobolev critical nonlinearities is obtained by some standard variational methods, whose key is to construct homotopies between Ω and levels of the functional J_λ,μ, and some analytical techniques.     

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.     

Asplund sets, differentiability and subdifferentiability of functions in Banach spaces

We show that Asplund sets are effective tools to study differentiability of Lipschitz functions, and ε-subdifferentiability of lower semicontinuous functions on general Banach spaces. If a locally Lipschitz function defined on an Asplund generated space has a minimal Clarke subdifferential mapping, then it is TBY-uniformly strictly differentiable on a dense Gδ subset of X. Examples are given of locally Lipschitz functions that are TBY-uniformly strictly differentiable everywhere, but nowhere Fréchet differentiable.     

Covering graphs with matchings of fixed size

Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting to consider minimum[m]-coverings, i.e. [m]-coverings containing as few matchings as possible. Such [m]-coverings will be called excessive[m]-factorizations. The number of matchings in an excessive [m]-factorization is a graph parameter which will be called the excessive[m]-index and denoted by . In this paper we begin the study of this new parameter as well as of a number of other related graph parameters.     

Estimating parameters of a multiple autoregressive model by the modified maximum likelihood method

We consider a multiple autoregressive model with non-normal error distributions, the latter being more prevalent in practice than the usually assumed normal distribution. Since the maximum likelihood equations have convergence problems (Puthenpura and Sinha, 1986) [11], we work out modified maximum likelihood equations by expressing the maximum likelihood equations in terms of ordered residuals and linearizing intractable nonlinear functions (Tiku and Suresh, 1992) [8]. The solutions, called modified maximum estimators, are explicit functions of sample observations and therefore easy to compute. They are under some very general regularity conditions asymptotically unbiased and efficient (Vaughan and Tiku, 2000) [4]. We show that for small sample sizes, they have negligible bias and are considerably more efficient than the traditional least squares estimators. We show that our estimators are robust to plausible deviations from an assumed distribution and are therefore enormously advantageous as compared to the least squares estimators. We give a real life example.     

Ramsey numbers for a disjoint union of good graphs

We give the Ramsey number for a disjoint union of some G-good graphs versus a graph G generalizing the results of Stahl (1975) [5] and Baskoro et al. (2006) [1] and the previous result of the author Bielak (2009) [2]. Moreover, a family of G-good graphs with s(G)>1 is presented.