Related papers: On approximation schemes and compactness
In this note, we study compactness and regularity theory of minimizing intrinsic fractional harmonic mappings introduced by Moser and Roberts. Based on the partial regularity theory of Moser and Roberts, we first use the modified Luckhaus…
The last theme of Kolmogorov's mathematics research was algorithmic theory of information, now often called Kolmogorov complexity theory. There are only two main publications of Kolmogorov (1965 and 1968-1969) on this topic. So Kolmogorov's…
The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…
We review some compactness methods appearing in the work of Lieb, with an emphasis on the techniques developed around his 1983 article on the optimizers for the Hardy-Littlewood-Sobolev inequality.
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
We prove that the Newton product of efficient polynomial projectors is still efficient. Various polynomial approximation theorems are established involving Newton product projectors on spaces of holomorphic functions on a neighborhood of a…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
In this paper we prove a compactness theorem for a sequence of harmonic maps which are defined on a converging sequence of Riemannian manifolds.
The purpose of this short note is to provide a new and very short proof of a result by Sudakov, offering an important improvement of the classical result by Kolmogorov-Riesz on compact subsets of Lebesgue spaces.
Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper…
This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…
The notions of compactness and Hausdorff separation for generalized enriched categories allow us, as classically done for the category $\mathsf{Top}$ of topological spaces and continuous functions, to study $\textit{compactly generated…
In order to have a better description of homogenization for parabolic partial differential equations with periodic coefficients, we define the notion of parametric two-scale convergence. A compactness theorem is proved to justify this…
We study reduction schemes for functions of "many" variables into system of functions in one variable. Our setting includes infinite-dimensions. Following Cybenko-Kolmogorov, the outline for our results is as follows: We present explicit…
We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…
This paper studies the compact coding approach to approximate nearest neighbor search. We introduce a composite quantization framework. It uses the composition of several ($M$) elements, each of which is selected from a different…
We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Following up on the systematic compactification of the two-channel Kondo model (and its multichannel extensions; arXiv:2308.03569 (companion paper I)) and the demonstration of its validity over the past proposal of compactification, we…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…