Related papers: Approximation spaces, greedy classes and Lorentz s…
We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new ingredient of the paper is that we bound the…
Starting categorically, we give simple and precise models of equivariant classifying spaces. We need these models for work in progress in equivariant infinite loop space theory and equivariant algebraic K-theory, but the models are of…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
The authors study Hardy spaces, of arbitrary order, on a space of homogeneous type. This extends earlier work that treated only $H^p$ for $p$ near 1. Applications are given to the boundedness of certain singular integral operators,…
We say that a finite metric space $X$ can be embedded almost isometrically into a class of metric spaces $C$, if for every $\epsilon > 0$ there exists an embedding of $X$ into one of the elements of $C$ with the bi-Lipschitz distortion less…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
We study the model space generated by the time-dependent operator coefficients in the effective field theory of the cosmological background evolution and perturbations of modified gravity and dark energy models. We identify three classes of…
A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…
We investigate two greedy strategies for finding an approximation to the minimum of a convex function $E$ defined on a Hilbert space $H$. We prove convergence rates for these algorithms under suitable conditions on the objective function…
This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards)…
The study of complexity and optimization in decision theory involves both partial and complete characterizations of preferences over decision spaces in terms of real-valued monotones. With this motivation, and following the recent…
For each sequence X of finite-dimensional Banach spaces there exists a sequence H of finite connected nweighted graphs with maximum degree 3 such that the following conditions on a Banach space Y are equivalent: (1) Y admits uniformly…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.
Model-based approaches bear great promise for decision making of agents interacting with the physical world. In the context of spatial environments, different types of problems such as localisation, mapping, navigation or autonomous…
Basic definitions and properties of nearly associative algebras are described. Nearly associative algebras are proved to be Lie-admissible algebras. Two-dimensional nearly associative algebras are classified, and its main classes are…
We investigate some new classes of operator algebras which we call semi-$\sigma$-finite subdiagonal and Riesz approximable. These constitute the most general setting to date for a noncommutative Hardy space theory based on Arveson's…
In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a…
Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop…
We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. S\'er. Sci. Math. Astronom. Phys. 12 (1964),…