相关论文: Bounds for Entropy Numbers of Some Critical Operat…
The aim of this paper is to provide upper bounds for the entropy numbers of summation operators on trees in a critical case. In a recent paper [10] we elaborated a framework of weighted summation operators on general trees where we related…
The entropy of a closure operator has been recently proposed for the study of network coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank…
Entropy numbers are an important tool for quantifying the compactness of operators. Besides establishing new upper bounds on the entropy numbers of diagonal operators $D_\sigma$ from $\ell_p$ to $\ell_q$, where $p\not=q$, we investigate the…
The purpose of this article is to develop a technique to estimate certain bounds for entropy numbers of diagonal operator on spaces of p-summable sequences for finite p greater than 1. The approximation method we develop in this direction…
In this article we continue to study the concept of entropy introduced in [4], [15]-[17]. We calculate entropy for a wider class of finite-dimensional operators in comparison with [15]. We also approximate the entropy of a unitary operator…
The asymptotic behavior for entropy numbers of general Fourier multiplier operators of multiple series with respect to an abstract complete orthonormal system $\{\phi_{\textbf{m}}\}_{\textbf{m}\in \mathbb{N}^d_0}$ on a probability space and…
Splitting methods constitute a widely used class of numerical integrators for ordinary and partial differential equations, particularly well suited to problems that can be decomposed into simpler subproblems. High-order splitting schemes…
We reformulate the notion of uncertainty of pairs of unitary operators within the context of guessing games and derive an entropic uncertainty relation for a pair of such operators. We show how distinguishable operators are compatible while…
In this paper we develop the following general approach. We study asymptotic behavior of the entropy numbers not for an individual smoothness class, how it is usually done, but for the collection of classes, which are defined by integral…
This paper will be devoted to study the two-weight norm inequalities of the multilinear fractional maximal operator $\mathcal{M}_{\alpha}$ and the multilinear fractional integral operator $\mathcal{I}_{\alpha}$. The entropy conditions in…
We investigate weighted inequalities for fractional maximal operators and fractional integral operators. We work within the innovative framework of "entropy bounds" introduced by Treil--Volberg. Using techniques developed by Lacey and the…
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with respect to the size of the domain. Thus, support for higher-order…
~In this paper, we investigate the boundedness of some Volterra-type operators between ~$Zygmund$~ type spaces. Then, we give the essential norms of such operators in terms of ~$g,\varphi$, their derivatives and the n-th power ~$\varphi^n$…
We define the entropic bounds, i.e minimal uncertainty for pairs of unitary testers in distinguishing between unitary transformations not unlike the well known entropic bounds for observables. We show that in the case of specific sets of…
Sharp upper and lower estimates are obtained of the approximation numbers of a Sobolev embedding and an integral operator of Volterra type. These lead to asymptotic formulae for the approximation numbers and certain other s-numbers.
The definition of $k^{th}$-order empirical entropy of strings is extended to node labelled binary trees. A suitable binary encoding of tree straight-line programs (that have been used for grammar-based tree compression before) is shown to…
The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the…
We give estimates of the entropy numbers of composition operators on the Hardy space of the disk and of the polydisk.
We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…