Common fixed point theorem for hybrid generalized multi-valued contraction mappings

In this paper, we introduce the notion of a hybrid generalized multi-valued contraction mapping and establish the common fixed point theorem for this mapping. Our results generalize, unify, extend and complement several common fixed point theorems of many authors in the literature.     

Fixed point theorems in fuzzy metric spaces

In the present work, we establish several fixed point theorems for a new class of self-maps in M-complete fuzzy metric spaces and compact fuzzy metric spaces, respectively.     

On the weak-approximate fixed point property

Let X be a Banach space and C a bounded, closed, convex subset of X. C is said to have the weak-approximate fixed point property if for any norm-continuous mapping , there exists a sequence {xn} in C such that (xn−fn(xn)) converges to 0 weakly. It is known that every infinite-dimensional Banach space with the Schur property does not have the weak-approximate fixed point property. In this article, we show that every Asplund space has the weak-approximate fixed point property. Applications to the asymptotic fixed point theory are given.     

The higher fixed point theorem for foliations I. Holonomy invariant currents

In this paper, we prove a higher Lefschetz formula for foliations in the presence of a closed Haefliger current. To this end, we associate with such a current an equivariant cyclic cohomology class of Connes' C^∗-algebra of the foliation, and compute its pairing with the localized equivariant K-theory in terms of local contributions near the fixed points.     

Asymptotic behavior of recursions via fixed point theory

In this paper we provide a formulation of initial value problems for (explicit and implicit) difference equations in terms of abstract equations in sequence spaces. They will be solved using appropriate fixed point theorems and we obtain quantitative attractivity properties.     

Convergence of a fixed point iteration method for the OSV model

In image processing, image denoising and texture extraction are important problems in which many new methods recently have been developed. One of the most important models is the OSV model [S. Osher, A. Solé, L. Vese, Image decomposition and restoration using total variation minimization and the H^-1 norm, Multiscale Model. Simul. A SIAM Interdisciplinary J. 1(3) (2003) 349-370] which is constructed by the total variation and H^-1 norm. This paper proves the existence of the minimizer of the functional from the OSV model and analyzes the convergence of an iterative method for solving the problems. Our iteration method is constructed by a fixed point iteration on the fourth order partial differential equation from the computation of the associated Euler-Lagrange equation, and the limit of our iterations satisfies the minimizer of the functional from the OSV model. In numerical experiments, we compare the numerical results of our works with those of the ROF model [L.I. Rudin, S. Osher, E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D 60 (1992) 259-268].     

Hardy spaces for the strip

In this paper we shall study Hardy spaces of analytic functions in a strip S. Our main result is on one hand an intrinsic characterization of the spaces and on the second that polynomials are dense. We also present an orthogonal (in H²(S)) basis of polynomials.     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .     

Existence and data dependence of fixed points for multivalued operators on gauge spaces

The purpose of this note is to present some fixed point and data dependence theorems in complete gauge spaces and in hyperconvex metric spaces for the so-called Meir-Keeler multivalued operators and admissible multivalued aα-contractions. Our results extend and generalize several theorems of Espínola and Kirk [R. Espínola, W.A. Kirk, Set-valued contractions and fixed points, Nonlinear Anal. 54 (2003) 485-494] and Rus, Petru?el, and Sînt?m?rian [I.A. Rus, A. Petru?el, A. Sînt?m?rian, Data dependence of the fixed point set of some multivalued weakly Picard operators, Nonlinear Anal. 52 (2003) 1947-1959].     

Tractability results for weighted Banach spaces of smooth functions

We study the L_∞-approximation problem for weighted Banach spaces of smooth d-variate functions, where d can be arbitrarily large. We consider the worst case error for algorithms that use finitely many pieces of information from different classes. Adaptive algorithms are also allowed. For a scale of Banach spaces we prove necessary and sufficient conditions for tractability in the case of product weights. Furthermore, we show the equivalence of weak tractability with the fact that the problem does not suffer from the curse of dimensionality.     

Applications of Michael's selection theorems to fixed point theory

Applying some of Ernest Michael's selection theorems, from recent fixed point theorems on u.s.c. multimaps, we deduce generalizations of the classical Bolzano theorem, several fixed point theorems on multimaps defined on almost convex sets, almost fixed point theorems, coincidence theorems, and collectively fixed point theorems. These results are related mainly to Michael maps, that is, l.s.c. multimaps having nonempty closed convex values.     

Complexity results on restricted instances of a paint shop problem for words

We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters.This is a special case of the paint shop problem for words, which was previously shown to be NP-complete. We show that this special case is also NP-complete and even APX-hard. Furthermore, derive lower bounds for this problem and discuss a transformation into matroid theory enabling us to solve some specific instances within polynomial time.     

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 binormality in non-separable Banach spaces

We study binormality, a separation property of the norm and weak topologies of a Banach space. We show that every Banach space which belongs to a P-class is binormal. We also show that the asplundness of a Banach space is equivalent to a related separation property of its dual space.     

Enumeration of bilaterally symmetric 3-noncrossing partitions

Schützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et al.’s correspondence for matchings and partitions. Thus the counting of bilaterally symmetric k-noncrossing partitions naturally arises as an analogue for involutions. In obtaining the analogous result for 3-noncrossing partitions, we use a different technique to develop a Maple package for 2-dimensional vacillating lattice walk enumeration problems. The package also applies to the hesitating case. As applications, we find several interesting relations for some special bilaterally symmetric partitions.     

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.     

Lifting Bailey pairs to WP-Bailey pairs

A pair of sequences such that and

     

A note on ball-covering property of Banach spaces

By a ball-covering B of a Banach space X, we mean that B is a collection of open (or closed) balls off the origin whose union contains the unit sphere SX of X; and X is said to have the ball-covering property (BCP) provided it admits a ball-covering by countably many balls. In this note we give a natural example showing that the ball-covering property of a Banach space is not inherited by its subspaces; and we present a sharp quantitative version of the recent Fonf and Zanco renorming result saying that if the dual X^∗ of X is w^∗ separable, then for every ε>0 there exist a (1+ε)-equivalent norm on X, and an R>0 such that in this new norm SX admits a ball-covering by countably many balls of radius R. Namely, we show that R=R(ε) can be taken arbitrarily close to (1+ε)/ε, and that for X=?₁[0,1] the corresponding R cannot be equal to 1/ε. This gives the sharp order of magnitude for R(ε) as ε→0.     

Projective modules over noncommutative tori are multi-window Gabor frames for modulation spaces

In the present investigation we link noncommutative geometry over noncommutative tori with Gabor analysis, where the first has its roots in operator algebras and the second in time-frequency analysis. We are therefore in the position to invoke modern methods of operator algebras, e.g. topological stable rank of Banach algebras, to display the deeper properties of Gabor frames. Furthermore, we are able to extend results due to Connes and Rieffel on projective modules over noncommutative tori to Banach algebras, which arise in a natural manner in Gabor analysis. The main goal of this investigation is twofold: (i) an interpretation of projective modules over noncommutative tori in terms of Gabor analysis and (ii) to show that the Morita-Rieffel equivalence between noncommutative tori is the natural framework for the duality theory of Gabor frames. More concretely, we interpret generators of projective modules over noncommutative tori as the Gabor atoms of multi-window Gabor frames for modulation spaces. Moreover, we show that this implies the existence of good multi-window Gabor frames for modulation spaces with Gabor atoms in e.g. Feichtinger's algebra or in Schwartz space.     

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.