Results 1 to 10 of about 1,197 (175)
The aim of this study is to prove the existence and uniqueness of fixed point and common fixed point theorems for self-mappings in modular ultrametric spaces.
Yahya Almalki +3 more
doaj +3 more sources
Some fixed point results on Ultrametric Space
The present paper deals with new fixed point theorems by means of F−contraction. The results are present in spherically complete ultrametric space for single valued rational type mappings.
Acar Özlem
doaj +2 more sources
Treeline Provides a Unified Strategy for Optimising Phylogenetic Trees Under Alternative Criteria. [PDF]
ABSTRACT The choice of optimality criterion is a key consideration in phylogenetic studies. Recent work challenges the notion that more computationally demanding optimisation objectives result in better phylogenetic trees. This finding underscores the importance of comparing trees across optimisation objectives in addition to different models of ...
Wright ES.
europepmc +2 more sources
Quantization of events in the event-universe and the emergence of quantum mechanics [PDF]
Quantum mechanics (QM) is derived based on a universe composed solely of events, for example, outcomes of observables. Such an event universe is represented by a dendrogram (a finite tree) and in the limit of infinitely many events by the p-adic tree ...
Oded Shor +2 more
doaj +2 more sources
On Some Model Theoretic Properties of Totally Bounded Ultrametric Spaces
Continuing investigations initiated by the first author, we associate relational structures for metric spaces and investigate their model theoretic properties. In this paper, we consider ultrametric spaces.
Gábor Sági, Karrar Al-Sabti
doaj +1 more source
Several Remarks on Dissimilarities and Ultrametrics [PDF]
We investigate the relationships between tolerance relations, equivalence relations, and ultrametrics. The set of spheres associated to an ultrametric space has a tree structure that rejects a hierarchy on the set of equivalences associated to that space.
D. A. Simovici
doaj +1 more source
Ultrametrics and Complete Multipartite Graphs
Let \((X, d)\) be a semimetric space and let \(G\) be a graph. We say that \(G\) is the diametrical graph of \((X, d)\) if \(X\) is the vertex set of \(G\) and the adjacency of vertices \(x\) and \(y\) is equivalent to the equality \(\diam X = d(x, y)\).
Viktoriia Viktorivna Bilet +2 more
doaj +1 more source
The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation
$\DeclareMathOperator{\ugh}{u_\mathrm{GH}}\DeclareMathOperator{\dgh}{d_\mathrm{GH}}$The Gromov-Hausdorff distance ($d_\mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two given metric spaces.
Facundo Mémoli +2 more
doaj +1 more source
A Simple Proof of Dvoretzky-Type Theorem for Hausdorff Dimension in Doubling Spaces
The ultrametric skeleton theorem [Mendel, Naor 2013] implies, among other things, the following nonlinear Dvoretzky-type theorem for Hausdorff dimension: For any 0 < β < α, any compact metric space X of Hausdorff dimension α contains a subset which is ...
Mendel Manor
doaj +1 more source
CUDA and OpenMp Implementation of Boolean Matrix Product with Applications in Visual SLAM
In this paper, the concept of ultrametric structure is intertwined with the SLAM procedure. A set of pre-existing transformations has been used to create a new simultaneous localization and mapping (SLAM) algorithm.
Amir Zarringhalam +3 more
doaj +1 more source

