Related papers: On computing fixpoints in well-structured regular …
In this paper, we obtain coupled fixed point theorem for (\psi, \phi)-contractions under some generalized conditions on the real valued functions \psi and \phi defined on (0,\infinity). Also, we present a generalized version of coupled…
New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
Almost-sure termination is an important correctness property for probabilistic programs, and a number of program logics have been developed for establishing it. However, these logics have mostly been developed for first-order programs…
The trend to equilibrium for reaction-diffusion systems modelling chemical reaction networks is investigated, in the case when reaction processes happen on subsets of the domain. We prove the convergence to equilibrium by directly showing…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…
We consider a diffusion process on the edges of a finite network and allow for feedback effects between different, possibly non-adjacent edges. This generalizes the setting that is common in the literature, where the only considered…
Our aim in this paper is to prove some interesting fixed point theorems for the class of asymptotically $T$-regular mappings in the framework of preordered modular G-metric spaces. Our results are novel and generalizes several know results.…
Incremental computation has recently been studied using the concepts of change structures and derivatives of programs, where the derivative of a function allows updating the output of the function based on a change to its input. We…
Based on the recently developed theory of random sequential compactness, we prove the random Kakutani fixed point theorem in random normed modules: if G is a random sequentially compact L0-convex subset of a random normed module, then every…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…
Systems of fixpoint equations over complete lattices, consisting of (mixed) least and greatest fixpoint equations, allow one to express a number of verification tasks such as model-checking of various kinds of specification logics or the…
Fixed point results with respect to generalized rational contractive mappings in semi-metric spaces endowed with a directed graph are proved. Some examples are provided to illustrate the results. The obtained results extend, improve and…