Related papers: On approximation schemes and compactness
The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by infinitely divisible laws may be transferred to the estimation of the closeness of…
Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the…
In this paper, we give a characterization of compact sets in $L^p$-spaces on metric measure spaces, which is a generalization of the Kolmogorov-Riesz theorem. Using the criterion, we investigate the topological type of the space consisting…
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
In this paper we characterize the approximation schemes that satisfy Shapiro's theorem and we use this result for several classical approximation processes. In particular, we study approximation of operators by finite rank operators and…
In 1951, Diliberto and Straus proposed a levelling algorithm for the uniform approximation of a bivariate function, defined on a rectangle with sides parallel to the coordinate axes, by sums of univariate functions. In the current paper, we…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We present forms of the classical Riesz-Kolmogorov theorem for compactness that are applicable in a wide variety of settings. In particular, our theorems apply to classify the precompact subsets of the Lebesgue space $L^2$, Paley-Wiener…
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…
We introduce a notion of compact association schemes, which serves as a compact analogue of classical (finite) association schemes. Our definition is formulated in a way that closely parallels the finite case, naturally admits a…
The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and…
The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
Approximate lattices of locally compact groups were first studied in a seminal monograph of Yves Meyer and were subsequently used in the theory of aperiodic order to model objects such as Pisot numbers, quasi-cristals or aperiodic tilings.…
Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to…