Related papers: Fixed point combinators as fixed points of higher-…
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…
Caputo fractional (with power-law kernels) and fractional (delta) difference maps belong to a more widely defined class of generalized fractional maps, which are discrete convolutions with some power-law-like functions. The conditions of…
We establish some common fixed point results for four transformations in vector S-metric spaces by using the notion of weakly compatibility (WC) and occasionally weakly compatibility (OWC). The first theorem is proved by using the concept…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
In this paper, we study the existence of common fixed points of family of multivalued mappings satisfying generalized F-contractive conditions in ordered metric spaces. These results establish some of the general common fixed point theorems…
Given an infinite word, enumerating its factors is an important exercise for understanding the structure of the word. The process of finding all the factors is quite tricky for two-dimensional words. In this paper, two possible ways of…
We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive…
For a topological space $X$ a topological contraction on $X$ is a closed mapping $f:X\to X$ such that for every open cover of $X$ there is a positive integer $n$ such that the image of the space $X$ via the $n$th iteration of $f$ is a…
The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources.…
This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point…
Fixed point ratios for primitive permutation groups have been extensively studied. Relying on a recent work of Burness and Guralnick, we obtain further results in the area. For a prime $p$ and a finite group $G$, we use fixed point ratios…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…
We establish the first common fixed point theorem for commutative set-valued mappings. This may help to generalize common fixed point theorems in single-valued setting to those in set-valued. We also prove the existence of a fixed point in…
We study weak and strong solutions of nonlinear non-compact operator equations in abstract spaces of adapted random points. The main result of the paper is similar to Schauder's fixed-point theorem for compact operators. The illustrative…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
We give a purely syntactical proof of the fixed point theorem for Sacchetti's modal logics ${\bf K} + \Box(\Box^n p \to p) \to \Box p$ ($n \geq 2$) of provability. From our proof, an effective procedure for constructing fixed points in…
In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…
A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…