Related papers: Domains via approximation operators
We prove the invertibility of the relevant single and double layer potentials associated to some generalizations of the Stokes operator on bounded domains. In order to do that, we first develop an ``algebra tool kit'' to deal with limit and…
Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…
We continue our study of operator algebras with and contractive approximate identities (cais). In earlier papers we have introduced and studied a new notion of positivity in operator algebras, with an eye to extending certain C*-algebraic…
The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…
Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…
Depending of the geometry of the domain, one can define --at least-- three different Stokes operators with Dirichlet boundary conditions. We describe how the resolvents of these Stokes operators converge with respect to a converging…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…
There are two methods to study families of conformal theories in the operator formalism. In the first method we begin with a theory and a family of deformed theories is defined in the state space of the original theory. In the other there…
An algebraization of the notion of topology has been proposed more than seventy years ago in a classical paper by McKinsey and Tarski. However, in McKinsey and Tarski's setting the model theoretical notion of homomorphism does not…
We study a notion analogous to the $p$-Approximation Property ($p$-AP) for Banach spaces, within the noncommutative context of operator spaces. Referred to as the $p$-Operator Approximation Property ($p$-OAP), this concept is linked to the…
This paper studies the weak one-step closure and one-step closure properties concerning the structure of Scott closures. We deduce that every quasicontinuous domain has weak one-step closure and show that a quasicontinuous poset need not…
The purpose of this paper is to study the approximation of vector valued mappings defined on a subset of a normed space. We investigate Korovkin-type conditions under which a given sequence of linear operators becomes a so-called…
One of the basic principles of Approximation Theory is that the quality of approximations increase with the smoothness of the function to be approximated. Functions that are smooth in certain subdomains will have good approximations in…
Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling by…
We present several equivalent conditions of the continuity of the supremum function from the square of the Scott space of $C(X)$ to itself under mild assumptions, where $C(X)$ denotes the lattice of closed subsets of a $\mathbf{T_0}$…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
In this paper, by means of upper approximation operators in rough set theory, we study representations for sL-domains and its special subclasses. We introduce the concepts of sL-approximation spaces, L-approximation spaces and…
Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…