相关论文: Approximate Fixed Point Property for Digital Trees…
This paper is concerning to the geometric study of fixed points of a self-mapping on a metric space. We establish new generalized contractive conditions which ensure that a self-mapping has a fixed disc or a fixed circle. We introduce the…
In all $\kappa$-accessible additive categories, $\kappa$-pure monomorphisms and $\kappa$-pure epimorphisms are well-behaved, as shown in our previous paper arXiv:2311.02418. This is known to be not always true in $\kappa$-accessible…
In this paper, we study the existence of fixed points for mappings defined on complete, (sequentially compact) cone metric spaces, satisfying a general contractive inequality depending of two additional mappings.
This article introduces descriptive fixed sets and their properties in descriptive proximity spaces viewed in the context of planar ribbon complexes. These fixed sets are a byproduct of descriptive proximally continuous maps that spawn…
Consider a point set D with a measure function w : D -> R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes, balls, k-oriented polygons). We say a range…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
In the following text we show if $X$ is an Alexandroff space, then $f:X\to Y$ has closed graph if and only if it has constant closed value on each connected component of $X$. Moreover, if $X$ an Alexandroff space and $f:X\to Y$ has closed…
For a connected graph $G$, the average hitting time $\alpha(G)$ and the Kemeny's constant $\kappa(G)$ are two similar quantities, both measuring the time for the random walk on $G$ to travel between two randomly chosen vertices. We prove…
We consider weighted tree automata over strong bimonoids (for short: wta). A wta $\mathcal{A}$ has the finite-image property if its recognized weighted tree language $[\![\mathcal{A}]\!]$ has finite image; moreover, $\mathcal{A}$ has the…
We present a version of the fundamental theorem of asset pricing (FTAP) for continuous time large financial markets with two filtrations in an $L^p$-setting for $ 1 \leq p < \infty$. This extends the results of Yuri Kabanov and Christophe…
We extend a theorem of Haagerup and Kraus in the C*-algebra context: for a locally compact group with the approximation property (AP), the reduced C*-crossed product construction preserves the strong operator approximation property (SOAP).…
In this paper we give some coupled fixed point results for mappings satisfying different contractive conditions on complete partial metric spaces.
We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…
The first aim of this paper is to examine some important properties of soft metric spaces. Second is to introduce soft continuous mappings and investigate properties of soft continuous mappings. Third is to prove some fixed point theorems…
Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
Multi-scale features are of great importance in encoding objects with scale variance in object detection tasks. A common strategy for multi-scale feature extraction is adopting the classic top-down and bottom-up feature pyramid networks.…
We combine aspects of the notions of finite decomposition complexity and asymptotic property C into a notion that we call finite APC-decomposition complexity. Any space with finite decomposition complexity has finite APC-decomposition…
Digital topology has its own working conditions and sometimes differs from the normal topology. In the area of topological robotics, we have important counterexamples in this study to emphasize this red line between a digital image and a…
It has been recently shown that the hidden variables of convolutional neural networks make for an efficient perceptual similarity metric that accurately predicts human judgment on relative image similarity assessment. First, we show that…