相关论文: Double newtonisation of fixed point sequences
Tensor network renormalization group maps study critical points of 2d lattice models like the Ising model by finding the fixed point of the RG map. In a prior work arXiv:2408.10312 we showed that by adding a rotation to the RG map, the…
We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…
In this paper, we introduce the neutrosophic contractive and neutrosophic mapping. We establish some results on fixed points of a neutrosophic mapping.
We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…
The problem of determining the (least) fixpoint of (higher-dimensional) functions over the non-negative reals frequently occurs when dealing with systems endowed with a quantitative semantics. We focus on the situation in which the…
A point x is a (bow) tie-point of a space X if X setminus {x} can be partitioned into (relatively) clopen sets each with x in its closure. Tie-points have appeared in the construction of non-trivial autohomeomorphisms of betaN setminus N…
Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to limit the mass transported between each pair of source and…
$N$ conformal theory models $WD^{(p)}_{3}$ coupled locally by their energy operators are analyzed by means of a perturbative renormalization group. New non-trivial fixed points are found.
Let (X, d) be a complete metric space, and let S, T : X to CB(X) be a duality of multi-valued generalized weak contraction mappings or a duality of generalized weak contraction mappings. We discuss the common fixed points and endpoints of…
A pervasive approach in scientific computing is to express the solution to a given problem as the limit of a sequence of vectors or other mathematical objects. In many situations these sequences are generated by slowly converging iterative…
Let $f:S^2\to S^2$ be a continuous map such that $deg f = d, |d|>1$. Suppose $f$ has two attracting fixed points denoted $N$ and $S$ and let $A=S^2\setminus \{N,S\}$. Assume that if a loop $\gamma\subset f^{-1}(A)$ is homotopically trivial…
An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…
Consider a holomorphic automorphism acting hyperbolically on an invariant compact set. It has been conjectured that the arising stable manifolds are all biholomorphic to Euclidean space. Such a stable manifold is always equivalent to the…
Let us give a two dimensional family of real vector fields. We suppose that there exists a stationary point where the linearized vector field has successively a stable focus, an unstable focus and an unstable node. When the parameter moves…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
This paper addresses the problem of matching $N$ weighted graphs referring to an identical object or category. More specifically, matching the common node correspondences among graphs. This multi-graph matching problem involves two…