Related papers: On approximation schemes and compactness
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
We introduce the notion of a relative log scheme with boundary: a morphism of log schemes together with a (log schematically) dense open immersion of its source into a third log scheme. The sheaf of relative log differentials naturally…
The aim of the paper is to characterize (pre)compactness in the spaces of Lipschitz/H\"older continuous mappings acting from a compact metric space to a normed space. To this end some extensions and generalizations of already existing…
We analyze a semi-implicit finite volume scheme for the Gray--Scott system, a model for pattern formation in chemical and biological media. We prove unconditional well-posedness of the fully discrete problem and establish qualitative…
We prove the Nagata compactification theorem for any separated map of finite type between quasi-compact and quasi-separated algebraic spaces, generalizing earlier results of Raoult. Along the way we also prove (and use) absolute noetherian…
The theory of rough sets was firstly introduced by Pawlak (see \cite{p}). Many Mathematician has been studied the relations between rough sets and algebraic systems such as groups, rings and modules. In this paper we will introduce the…
Organising the relevant literature and by letting statistical convergence play the main role in the theory of compactness, a variant of compactness called statistical compactness has been achieved. As in case of sequential compactness, one…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
The relationship between the operator approximation property and the strong operator approximation property has deep significance in the theory of operator algebras. The original definitions of Effros and Ruan, unlike the classical…
We survey the Kolmogorov's approach to the notion of randomness through the Kolmogorov complexity theory. The original motivation of Kolmogorov was to give up a quantitative definition of information. In this theory, an object is randomness…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
Divided into three parts, the first marks out enormous geometric issues with the notion of quasi-freenss of an algebra and seeks to replace this notion of formal smoothness with an approximation by means of a minimal unital commutative…
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
In 2011, the first author introduced (relative) Riemann-Zariski spaces corresponding to a morphism of schemes and established their basic properties. In this paper we clarify that theory and extend it to morphisms between algebraic spaces.…
This paper introduces a notion of categorical approximability for metric spaces that can be viewed as a categorification of approximability for metric groups, as defined by Turing in 1938. Approximability as introduced here is a property of…