Related papers: Some remarks on the pointwise sparse domination

It is well known that not every summability property for non linear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to…

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

The pathwise coordinate optimization is one of the most important computational frameworks for high dimensional convex and nonconvex sparse learning problems. It differs from the classical coordinate optimization algorithms in three salient…

We give a revised version of Schmidt's treatment of forms in many variables, which allows us to prove a Hasse principle under more lenient conditions on the number of variables than what had previously been thought possible with these…

Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the…

Sparsity plays a central role in recent developments in signal processing, linear algebra, statistics, optimization, and other fields. In these developments, sparsity is promoted through the addition of an $L^1$ norm (or related quantity)…

We prove well-posedness for some abstract differential equations of the first order. Our result covers the usual case of Lipschitz composition operators. It also contains the case of some integro-differential operators acting on spaces with…

We introduce a suitable notion of integral operators (comprising the fractional Laplacian as a particular case) acting on functions with minimal requirements at infinity. For these functions, the classical definition would lead to divergent…

We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…

The purpose of this paper is three-fold: first, we survey on several known pointwise identities involving fractional operators; second, we propose a unified way to deal with those identities; third, we prove some new pointwise identities in…

Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…

In this article, we study discrete maximal function associated with the Birch-Magyar averages over sparse sequences. We establish sparse domination principle for such operators. As a consequence, we obtain $\ell^p$-estimates for such…

We show some simple sufficient conditions for which the multilinear embedding theorem holds for fractional sparse operators. By verifying these conditions, we establish the theorem for power weights. We also provide Morrey-type sufficient…

We prove an easy version of the minimax theorem with no topological assumption. We deduce from it some domination criteria as well as an application to $p$-summing operators.

Instance sparsification is well-known in the world of exact computation since it is very closely linked to the Exponential Time Hypothesis. In this paper, we extend the concept of sparsification in order to capture subexponential time…

We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances…

This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…

We suggest an efficient algorithm for the selection of sparse subsets of a set of influence for the numerical discretization of differential operators on irregular nodes with polynomial consistency of a given order with the help of the QR…

We establish quantitative upper and lower bounds for Schr\"odinger operators with complex potentials that satisfy some weak form of sparsity. Our first result is a quantitative version of an example, due to S.\ Boegli (Comm. Math. Phys.,…

In this paper, using a new technique from harmonic analysis called sparse domination, we characterize the positive Borel measures including forward, vanishing, and reverse Bergman Carleson measures. The main novelty of this paper is…