Related papers: Fixed Points and Noetherian Topologies

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…

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…

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…

We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by…

We propose a unified framework for random locations exhibiting some probabilistic symmetries such as stationarity, self-similarity, etc. A theorem of Noether's type is proved, which gives rise to a conservation law describing the change of…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…

Our main theorem is an extension of the well-known Mizoguchi-Takahaashi's fixed point theorem [N. Mizogochi and W. Takahashi, Fixed point theorems for multi-valued mappings on complete metric space, {\it J. Math. Anal. Appl.} 141 (1989)…

In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…

In this article, we develop a technique to "split" certain types of partially ordered sets into simpler ones and use that technique to give a partial answer to a conjecture by R. Wiegand and S. Wiegand on the structure of semi-local,…

We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness relation between atoms and terms can be derived from the more…

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…

In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular…

We formulate a categorification of Robertson's conjecture analogous to the categorical graph minor conjecture of Miyata--Proudfood--Ramos. We show that these conjectures imply the existence of a finite list of atomic graphs generating the…

We prove a Noether-type symmetry theorem for invariant optimal control problems with unrestricted controls. The result establishes weak conservation laws along all the minimizers of the problems, including those minimizers which do not…