Abstract: The paper deals with the approximate controllability of a semi-linear stochastic system with multiple delays in control in infinite dimensional spaces. Sufficient conditions for the approximate controllability of the semi-linear control system have been established. The results are obtained using the Banach fixedpoint theorem. An example is introduced to show the effectiveness of the ...

I show that the general implicit-function problem (or parametrized fixedpoint problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this formula for both analytic functions and formal power series.

In this paperwe consider a linear scalar differential equationwith variable delays andgive conditions to ensure that the zero solution is asymptotically stable bymeans of fixedpoint theory.These conditions do not require the boundedness of delays, nor do they ask for a fixed sign on the coefficient functions. An asymptotic stability theorem with a necessary and sufficient condition is proved. 2...

In this talk I review some aspects of the idea that there is an infra-red conformal fixedpoint at the TeV scale. In particular, it is shown how gauge coupling unification can be achieved by TeV unification in a semi-simple gauge group.

this paper studies the existence of solutions for acoupled system of nonlinear fractional differential equations. newexistence and uniqueness results are established using banach fixedpoint theorem. other existence results are obtained using schaeferand krasnoselskii fixed point theorems. some illustrative examplesare also presented.

in the present paper, we give a new approach to caristi's fixed pointtheorem on non-archimedean fuzzy metric spaces. for this we define anordinary metric $d$ using the non-archimedean fuzzy metric $m$ on a nonemptyset $x$ and we establish some relationship between $(x,d)$ and $(x,m,ast )$%. hence, we prove our result by considering the original caristi's fixedpoint theorem.

A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every function and parameterizing the semantics by this choice we abstract from the parameterpassing mechanism. Thus common and distinguishing features of a...

We incorporate externalities into the stable matching theory of two-sided markets: We establish the existence of stable matchings provided that externalities are positive and agents’ choices satisfy substitutability, and we show that the standard insights of matching theory, such as the existence of side optimal stable matchings and the rural hospitals theorem, remain valid despite the presence...

Entanglement is a digraph complexity measure that origins in fixedpoint theory. Its purpose is to count the nested depth of cycles in digraphs. In this paper we prove that the class of undirected graphs of entanglement at most k, for arbitrary fixed k ∈ N, is closed under taking minors. Our proof relies on the game theoretic characterization of entanglement in terms of Robber and Cops games.

Abstract In this paper, we study the resonance problem of a class of singular quasilinear parabolic equations with respect to its higher near-eigenvalues. Under a generalized Landesman-Lazer condition, it is proved that the resonance problem admits at least one nontrivial solution in weighted Sobolev spaces. The proof is based upon applying the Galerkin-type technique, the Brouwer’s fixedpoint ...