Search

In this paper, we study the tangential touch and C¹ regularity of the free boundary near the fixed boundary of the double obstacle problem for Laplacian and fully nonlinear operator. The main idea to have the properties is regarding the upper obstacle as a solution of the single obstacle problem. Then, in the classification of global solutions of the double problem, it is enough to consider only two cases for the upper obstacle, a/2 xn² or a/2 xn² + bxnx1 for some b ∈ ℝ, b ≠ 0. The second one is a new type of upper obstacle, which does not exist in the study of local regularity of the free boundary of the double problem. Thus, in this paper, a new type of difficulties that come from the second type upper obstacle is mainly studied. [ABSTRACT FROM AUTHOR]

In this paper, we employ the well-known Krasnoselskii fixed point theorem to study the existence and n-multiplicity of positive periodic solutions for the periodic impulsive functional differential equations with two parameters. The form including an impulsive term of the equations in this paper is rather general and incorporates as special cases various problems which have been studied extensively in the literature. Easily verifiable sufficient criteria are obtained for the existence and n-multiplicity of positive periodic solutions of the impulsive functional differential equations. [ABSTRACT FROM AUTHOR]

In this paper using new fixed point results of the author, we establish a variety of existence results for equilibria for abstract economies. [ABSTRACT FROM AUTHOR]

In this paper, we focus on the existence of the best proximity points in binormed linear spaces. As a consequence, we obtain some fixed point results. We also provide some illustrations to support our claims. As applications, we obtain the existence of a solution to split feasible and variational inequality problems. [ABSTRACT FROM AUTHOR]

In the present paper, we characterize Lie (Jordan) σ-centralizers of generalized matrix algebras. More precisely, we obtain some conditions under which every Lie σ-centralizer of a generalized matrix algebra can be expressed as the sum of a σ-centralizer and a center- valued mapping. Further, it is shown that under certain appropriate assumptions every Jordan σ-centralizer of a generalized matrix algebra is a σ-centralizer. Finally, the main results are applied to triangular algebras. [ABSTRACT FROM AUTHOR]

The exponential space, which is a Banach function space, can be defined with two very differently looking, but equivalent norms. In this paper, we give estimates for the best constants of the ratio of these two norms. Our result answers a question of C. Bennett, and R. Sharpley. [ABSTRACT FROM AUTHOR]

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventies of the twentieth century by B. Zelinka and the first author (see e.g. [6] and the monograph [1] and the references therein). Since tolerances need not be transitive, their blocks may overlap and hence in general the set of all blocks of a tolerance cannot be converted into a quotient algebra in the same way as in the case of congruences. However, G. Czédli ([7]) showed that lattices can be factorized by means of tolerances in a natural way, and J. Grygiel and S. Radeleczki ([8]) proved some variant of an Isomorphism Theorem for tolerances on lattices. The aim of the present paper is to extend the concept of a tolerance on a lattice to posets in such a way that results similar to those obtained for tolerances on lattices can be derived. [ABSTRACT FROM AUTHOR]

In this paper, we study the existence and stability of solutions for impulsive pantograph fractional integro-differential equation via ψ-Hilfer fractional derivative in a appropriate Banach space. Our approach is based on fixed point theorems of Darbo’s and Mönch via Kuratowski measure of non-compactness. An example is given to illustrate our approach. [ABSTRACT FROM AUTHOR]

Let U be a Hilbert A-module and L(U) the set of all adjointable A-linear maps on U. Let K = {Λx ∈ L(U, Vx) : x ∈ X } and L = {Γx ∈ L(U, Vx) : x ∈ X } be two continuous g-frames for U, K is said to be similar with L if there exists an invertible operator J ∈ L(U) such that Γx = ΛxJ, for all x ∈ X . In this paper, we define the concepts of closeness and nearness between two continuous g-frames. In particular, we show that K and L are near, if and only if they are similar. [ABSTRACT FROM AUTHOR]

In this paper we first introduce N̅qΔ − summable difference sequence spaces and prove some properties of these spaces. We then obtain the necessary and sufficient conditions for infinite matrix A to map these sequence spaces on the spaces c, c0 and l∞. Finally, the Hausdorff measure of noncompactness is then used to obtain the necessary and sufficient conditions for the compactness of the linear operators defined on these spaces. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of weak Weak θ-φ-contraction ensuring a convergence of successive approximations but does not force the mapping to be continuous at the fixed point. Thus, we answer one more solution to the open question raised by Rhoades in [B. E. Rhoades, Fixed point theory Appl, Berkeley, CA, (1986), Contemp. Math., Amer. Math. Soc., Providence, RI, 72 (1988), 233-245]. [ABSTRACT FROM AUTHOR]

The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We establish some of the foundations of computational spectral theory through the Solvability Complexity Index (SCI) hierarchy, an approach closely related to Smale’s program on the foundations of computational mathematics and McMullen’s results on polynomial root finding with rational maps. Infinite-dimensional problems yield an intricate infinite classification theory, determining which spectral problems can be solved and with what types of algorithms. We provide answers to many longstanding open questions on the existence of algorithms. For example, we show that spectra can be computed, with error control, from point sampling operator coefficients for large classes of partial differential operators on unbounded domains. Further results include: computing spectra of (possibly unbounded) operators on graphs and separable Hilbert spaces with error control; determining if the spectrum intersects a compact set; the computational spectral gap problem and computing spectral classifications at the bottom of the spectrum; and computing discrete spectra, multiplicities, eigenspaces and determining if the discrete spectrum is non-empty. Moreover, the positive results with error control can be used in computer-assisted proofs. In contrast, the negative results preclude computer-assisted proofs for classes of operators as a whole. Our proofs are constructive, yielding a library of new algorithms and techniques that handle problems that before were out of reach. We demonstrate these algorithms on challenging problems, giving concrete examples of the failure of traditional approaches (e.g., “spectral pollution”) compared to the introduced techniques. [ABSTRACT FROM AUTHOR]

This paper is concerned with the following fourth-order three-point boundary value problem ... where n ∊ [1/3, 1). In spite of sign-changing Green's function, for arbitrary positive integer n (≥ 2), we still obtain the existence of at least n - 1 decreasing positive solutions to the above problem by imposing some suitable conditions on f . The main tool used is the fixed point index theory. [ABSTRACT FROM AUTHOR]

This article is devoted to studying a nonhomogeneous boundary value problem involving Stieltjes integral for a more general form of the fractional q-difference equation with p(t)-Laplacian operator. Here p(t)-Laplacian operator is nonstandard growth, which has been used more widely than the constant growth operator. By using fixed point theorems of ... - (h, e)-concave operators some conditions, which guarantee the existence of a unique positive solution, are derived. Moreover, we can construct an iterative scheme to approximate the unique solution. At last, two examples are given to illustrate the validity of our theoretical results. [ABSTRACT FROM AUTHOR]