Related papers: Lebesgue inequalities for Chebyshev Thresholding G…
It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…
In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization.
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
We derive optimal asymptotic and non-asymptotic lower bounds on the Widom factors for weighted Chebyshev and orthogonal polynomials on compact subsets of the real line. In the Chebyshev case we extend the optimal non-asymptotic lower bound…
We survey results on Chebyshev polynomials centered around the work of H. Widom. In particular, we discuss asymptotics of the polynomials and their norms and general upper and lower bounds for the norms. Several open problems are also…
We study the problem of estimating a random process from the observations collected by a network of sensors that operate under resource constraints. When the dynamics of the process and sensor observations are described by a state-space…
Using the generic chaining method, we derive upper bounds for the \(L^q\) process of sub-Gaussian classes when \(1 \le q \le 2\), thereby resolving an open problem posed by Al-Ghattas, Chen, and Sanz-Alonso in arXiv:2502.16916. Combined…
In this article, we present a concavity property of the minimal $L^2$ integrals related to multiplier ideal sheaves with Lebesgue measurable gain. As applications, we give necessary conditions for our concavity degenerating to linearity,…
The Greedy algorithm is the simplest heuristic in sequential decision problem that carelessly takes the locally optimal choice at each round, disregarding any advantages of exploring and/or information gathering. Theoretically, it is known…
We introduce the notion of a \textit{weight-almost greedy} basis and show that a basis for a real Banach space is $w$-almost greedy if and only if it is both quasi-greedy and $w$-democratic. We also introduce the notion of…
Prime counting functions are believed to exhibit, in various contexts, discrepancies beyond what famous equidistribution results predict; this phenomenon is known as Chebyshev's bias. Rubinstein and Sarnak have developed a framework which…
Erd\H{o}s and Graham found it conceivable that the best $n$-term Egyptian underapproximation of almost every positive number for sufficiently large $n$ gets constructed in a greedy manner, i.e., from the best $(n-1)$-term Egyptian…
Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…
In this paper we improve and complement a result by M\'oricz and Siddiqi \cite{Mor}. In particular, we prove that their inequality of the N\"orlund means with respect to the Walsh system holds also without their additional condition.…
We present a novel stagewise strategy for improving greedy algorithms for sparse recovery. We demonstrate its efficiency both for synthesis and analysis sparse priors, where in both cases we demonstrate its computational efficiency and…
We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…
We develop refinements of the Levenshtein bound in $q$-ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by Levenshtein. The first relevant cases are…
Given a graph $G=(V,E)$, suppose we are interested in selecting a sequence of vertices $(x_j)_{j=1}^n$ such that $\left\{x_1, \dots, x_k\right\}$ is `well-distributed' uniformly in $k$. We describe a greedy algorithm motivated by potential…
In this paper we recontextualize the theory of matrix weights within the setting of Banach lattices. We define an intrinsic notion of directional Banach function spaces, generalizing matrix weighted Lebesgue spaces. Moreover, we prove an…
There are two main aims of the paper. The first one is to extend the criterion for the precompactness of sets in Banach function spaces to the setting of quasi-Banach function spaces. The second one is to extend the criterion for the…