Related papers: Fixed point combinators as fixed points of higher-…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
Recently a permutation on Dyck paths, related to the chip firing game, was introduced and studied by Barnabei et al.. It is called $\gamma$-operator, and uses symmetries and reflections to relate Dyck paths having the same length. A…
Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…
This article presents a deep investigation of fixed points for multivalued weak contractions in cone metric spaces. We extend Berinde weak contraction principles to the multivalued setting in cone metric spaces, developing existence,…
Locating the sources of forced low-frequency oscillations in power systems is an important problem. A number of proposed methods demonstrate their practical usefulness, but many of them rely on strong modeling assumptions and provide poor…
Fixed points in QCD can appear when the number of quark flavors ($N_f$) is increased above a certain critical value as proposed by Banks and Zaks (BZ). There is also the possibility that QCD possess an effective charge indicating an…
In this work, we define the concept of mixed $G$-monotone mappings defined on a metric space endowed with a graph. Then we obtain sufficient conditions for the existence of coupled fixed points for such mappings when a weak contractivity…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+lfp) with background theories. Such logics, unlike pure…
The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…
We describe a type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). The type system supports linear typing, which enhances the safety properties of programs, but also supports…
We discuss some results concerning fixed point equations in the setting of topological *-algebras of unbounded operators. In particular, an existence result is obtained for what we have called {\em weak $\tau$ strict contractions}, and some…
We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…
In this paper, we study the weakest possible conditions for fixed point theorems involving two classes of mappings defined by Kannan and Chatterjea. Our approach relies on the so-called CJM condition, which was originally introduced by…
In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…
We present a construction of a certain infinite complete partial order (CPO) that differs from the standard construction used in Scott's denotational semantics. In addition, we construct several other infinite CPO's. For some of those, we…
Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…
The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule -- a differentiable function consisting of two linear mappings…
In this paper we establish some common fixed point theorem for a new class of pair of contractions mappings, called $\psi-(\alpha,\beta, m)$-contraction pairs, which we will assume occasionally weakly compatible and satisfying the property…
We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…