相关论文: Some remarks on the pointwise sparse domination
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…
We give an alternative proof of a recent result by T.D. Browning and A. Haynes (arXiv:1204.6374v1) on multiplicative inverses in sequences of intervals and improve this result under additional conditions on the spacing of these intervals.
This paper develops some deeper consequences of an extended definition, proposed previously by the author, of pseudo-differential operators that are of type $1,1$ in H\"ormander's sense. Thus, it contributes to the long-standing problem of…
The celebrated sparse representation model has led to remarkable results in various signal processing tasks in the last decade. However, despite its initial purpose of serving as a global prior for entire signals, it has been commonly used…
We study an extremal projection principle for families of operators ordered by domination, induced by fixed bounded linear mappings acting on a source with an additive baseline. Stability is defined through domination of second--order…
We consider optimal control of fractional in time (subdiffusive, i.e., for $% 0<\gamma <1$) semilinear parabolic PDEs associated with various notions of diffusion operators in an unifying fashion. Under general assumptions on the…
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…
The problem of estimating the frequencies of an exponential sum has been studied extensively over the last years. It can be understood as a sparse estimation problem, as it strives to identify the sparse representation of a signal using…
Consider a sequence of positive integers $\{k_n,n\ge1\}$, and an array of nonnegative real numbers $\{a_{n,i},1\le i\le k_n,n\ge1\}$ satisfying $\sup_{n\ge 1}\sum_{i=1}^{k_n}a_{n,i}=C_0\in (0,\infty).$ This paper introduces the concept of…
This article makes no claim to originality, other than, perhaps, the simple statement here called the {\it Abstract Maximum Principle}. Actually, the whole contents are strongly based on some H. Sussmann's and coauthors' papers, in which,…
A theorem of J. Bochi and N. Gourmelon states that an invertible linear cocycle admits a dominated splitting if and only if the singular values of its iterates become separated at a uniform exponential rate. It is not difficult to show that…
Sparsity-based models and techniques have been exploited in many signal processing and imaging applications. Data-driven methods based on dictionary and sparsifying transform learning enable learning rich image features from data, and can…
Sparse optimization receives increasing attention in many applications such as compressed sensing, variable selection in regression problems, and recently neural network compression in machine learning. For example, the problem of…
In the first part of the paper we study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories. Then we try to develop analogous theory for arbitrary dependent theories.
This paper addresses a large class of vector optimization problems in infinite-dimensional spaces with respect to two important binary relations derived from domination structures. Motivated by theoretical challenges as well as by…
In the machine learning era, sparsity continues to attract significant interest due to the benefits it provides to learning models. Algorithms aiming to optimise the \(\ell_0\)- and \(\ell_1\)-norm are the common choices to achieve…
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that…
We prove a characteristic $p$ version of a theorem of Silverman on integral points in orbits over number fields and establish a primitive prime divisor theorem for polynomials in this setting. We provide some applications of these results,…
After the introduction in 1994, by Okabe and Matsuda, of the notion of semistar operation, many authors have investigated different aspects of this general and powerful concept. A natural development of the recent work in this area leads to…
Making use of the method of subordination chains, we obtain some sufficient conditions for the univalence of an integral operator. In particular, as special cases, our results imply certain known univalence criteria. A refinement to a…