相关论文: Fixed Points of Self-embeddings of Models of Arith…
Soss proved that it is NP-hard to find the maximum 2D span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixed-angle chains can serve as models of protein backbones. The…
We are concerned with the study of fixed points for mappings $T: X\to X$, where $(X,G)$ is a $G$-metric space in the sense of Mustafa and Sims. After the publication of the paper [Journal of Nonlinear and Convex Analysis. 7(2) (2006)…
Metric embeddings into structured spaces, particularly hierarchically well-separated trees (HSTs), are a fundamental tool in the design of online algorithms. In the classical online embedding setting, points arrive sequentially and must be…
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…
We study the existence and approximation of fixed points of metrically nonspreading mappings and firmly metrically nonspreading mappings in Hadamard spaces. The resolvents of monotone operators satisfying range conditions are typical…
We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…
We establish a simple and powerful lemma that provides a criterion for sequences in metric spaces to be Cauchy. Using the lemma, it is then easily verified that the Picard iterates $\{T^nx\}$, where $T$ is a contraction or asymptotic…
We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…
In this paper we study a class of embeddings of tent inverse limit spaces. We introduce techniques relying on the Milnor-Thurston kneading theory and use them to study sets of accessible points and prime ends of given embeddings. We…
We study the cubic fixed point for $N=3$ and $4$ by using finite size scaling applied to data obtained from Monte Carlo simulations of the $N$-component $\phi^4$ model on the simple cubic lattice. We generalize the idea of improved models…
It is generally known that in order to solve the split equality fixed-point problem (SEFPP), it is necessary to compute the norm of bounded and linear operators, which is a challenging task in real life, to address this issue, we studied…
Popular network models such as the mixed membership and standard stochastic block model are known to exhibit distinct geometric structure when embedded into $\mathbb{R}^{d}$ using spectral methods. The resulting point cloud concentrates…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
In this paper, we are concerned with the study of the existence of fixed points for single and multi-valued three-points contractions. Namely, we first introduce a new class of single-valued mappings defined on a metric space equipped with…
In this oaper, we prove some fixed point theorems in metric vector spaces, in which the continuity is not required for the considered mappings to satisfy. We provide some concrete examples to demonstrate these theorems. We also give some…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.
Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…
The following natural question arises from Shalom's innovational work (1999, Publ. IHES): "Can we establish an intrinsic criterion to synthesize relative fixed point properties into the whole fixed point property without assuming Bounded…
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…