Related papers: Embeddings and Lebesgue-type inequalities for the …
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of bases that made their appearance in functional analysis from very different areas of research. One of our aims in this note is to show that,…
We study a class of quasi-variational inequality problems defined over infinite dimensional Banach space and deduce sufficient conditions for ensuring solutions to such problems under the upper semi-continuity and pseudomonotonicity…
In this article we obtain the non - asymptotical low estimations for bilinear Riesz's functional through the Lebesgue spaces norms by means of building of some examples.
We consider the problem of studying the performance of greedy algorithm on sensor selection problem for stable linear systems with Kalman Filter. Specifically, the objective is to find the system parameters that affects the performance of…
We introduce a so-called restricted, in particular, discrete version of (Banach) Grand Lebesgue Spaces (GLS), investigate its properties and derive the conditions of coincidence with the classical ones. We show also that these spaces forms…
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of $2$ for the \emph{unweighted} matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted…
In this paper we obtain the non - asymptotic estimations for Riesz's and Bessel's potential integral operators in the so - called Bilateral Grand Lebesgue Spaces. We also give examples to show the sharpness of these inequalities.
We study the asymptotic behaviour of the approximation, Gelfand and Kolmogorov numbers of the compact embeddings of weighted function spaces of Besov and Triebel-Lizorkin type in the case where the weights belong to a large class. We obtain…
In this article, we present two new greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, and prove some convergence results for these algorithms and their…
The purpose of this article is to generalize some known characterizations of Banach space properties in terms of graph preclusion. In particular, it is shown that superreflexivity can be characterized by the non-equi-bi-Lipschitz…
We investigate various relaxations of additivity for set maps into Banach spaces in the context of representations of amenable groups. Specifically, we establish conditions under which asymptotically additive and almost additive set maps…
This letter studies the problem of minimizing increasing set functions, or equivalently, maximizing decreasing set functions, over the base of a matroid. This setting has received great interest, since it generalizes several applied…
We study the problem of distributed state estimation in a network of sensing units that can exchange their measurements but the rate of communication between the units is constrained. The units collect noisy, possibly only partial…
Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…
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…
Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distributed weighted matching algorithms is challenging due to the…
We study the worst-case adaptive optimization problem with budget constraint that is useful for modeling various practical applications in artificial intelligence and machine learning. We investigate the near-optimality of greedy algorithms…
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
In this work we obtain a transference theorem for Lebesgue spaces with $A_{\infty }$ weights, namely, starting from some uniform-norm inequalities it is possible to obtain similar inequalities in Lebesgue spaces with $A_{\infty }$ weights.…