Results 41 to 50 of about 2,082 (82)
A universal finite‐type invariant of knots in homology 3‐spheres
Abstract An essential goal in the study of finite‐type invariants of some objects (knots, manifolds) is the construction of a universal finite‐type invariant, universal in the sense that it contains all finite‐type invariants of the given objects. Such a universal finite‐type invariant is known for knots in the 3‐sphere — the Kontsevich integral — and ...
Benjamin Audoux, Delphine Moussard
wiley +1 more source
Sequences suffice for pointfree uniform completions
Abstract Completions of metric spaces are usually constructed using Cauchy sequences. However, this does not work for general uniform spaces, where Cauchy filters or nets must be used instead. The situation in pointfree topology is more straightforward: the correct completion of uniform locales can indeed be obtained as a quotient of a locale of Cauchy
Graham Manuell
wiley +1 more source
From abstraction to reality: DARPA's vision for robust sim‐to‐real autonomy
Abstract The DARPA Transfer from Imprecise and Abstract Models to Autonomous Technologies (TIAMAT) program aims to address rapid and robust transfer of autonomy technologies across dynamic and complex environments, goals, and platforms. Existing methods for simulation‐to‐reality (sim‐to‐real) transfer often rely on high‐fidelity simulations and ...
Erfaun Noorani +3 more
wiley +1 more source
An electrical engineering perspective on missed opportunities in computational physics
We look at computational physics from an electrical engineering perspective and suggest that several concepts of mathematics, not so well-established in computational physics literature, present themselves as opportunities in the field.
Kotiuga, P. Robert +2 more
core
The category of von Neumann correspondences from B to C (or von Neumann B-C-modules) is dual to the category of von Neumann correspondences from C' to B' via a functor that generalizes naturally the functor that sends a von Neumann algebra to its ...
Skeide, M.
core +1 more source
Computational Complexity of the Interleaving Distance
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Bjerkevik, Håvard Bakke +1 more
core
Fuglede-Kadison determinant: theme and variations. [PDF]
de la Harpe P.
europepmc +1 more source
Neural correlates of the relationship between discourse coherence and sensory monitoring in schizophrenia. [PDF]
Tagamets MA +3 more
europepmc +1 more source
Interpolation functors, sequence ideals and operator ideals [PDF]
openaire +1 more source

