اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultiplicative Lidskiis inequalities and optimal perturbations of frames
261
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we study two design problems in frame theory: on the one hand, given a fixed finite frame $cF$ for $hilcongC^d$ we compute those dual frames $cG$ of $cF$ that are optimal perturbations of the canonical dual frame for $cF$ under certain restrictions on the norms of the elements of $cG$. On the other hand, for a fixed finite frame $cF={f_j}_{jinIn}$ for $hil$ we compute those invertible operators $V$ such that $V^*V$ is a perturbation of the identity and such that the frame $Vcdot cF={V,f_j}_{jinIn}$ - which is equivalent to $cF$ - is optimal among such perturbations of $cF$. In both cases, optimality is measured with respect to submajorization of the eigenvalues of the frame operators. Hence, our optimal designs are minimizers of a family of convex potentials that include the frame potential and the mean squared error. The key tool for these results is a multiplicative analogue of Lidskiis inequality in terms of log-majorization and a characterization of the case of equality.
قيم البحث
اقرأ أيضاً
In this paper we consider two problems in frame theory. On the one hand, given a set of vectors $mathcal F$ we describe the spectral and geometrical structure of optimal completions of $mathcal F$ by a finite family of vectors with prescribed norms,
where optimality is measured with respect to majorization. In particular, these optimal completions are the minimizers of a family of convex functionals that include the mean square error and the Bendetto-Fickus frame potential. On the other hand, given a fixed frame $mathcal F$ we describe explicitly the spectral and geometrical structure of optimal frames $mathcal G$ that are in duality with $mathcal F$ and such that the Frobenius norms of their analysis operators is bounded from below by a fixed constant. In this case, optimality is measured with respect to submajorization of the frames operators. Our approach relies on the description of the spectral and geometrical structure of matrices that minimize submajorization on sets that are naturally associated with the problems above.
In 2012 Gu{a}vruc{t}a introduced the notions of $K$-frame and of atomic system for a linear bounded operator $K$ in a Hilbert space $mathcal{H}$, in order to decompose its range $mathcal{R}(K)$ with a frame-like expansion. In this article we revisit
these concepts for an unbounded and densely defined operator $A:mathcal{D}(A)tomathcal{H}$ in two different ways. In one case we consider a non-Bessel sequence where the coefficient sequence depends continuously on $finmathcal{D}(A)$ with respect to the norm of $mathcal{H}$. In the other case we consider a Bessel sequence and the coefficient sequence depends continuously on $finmathcal{D}(A)$ with respect to the graph norm of $A$.
Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanic
al (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a new class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangles area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e. the achievable bound using only classical correlations is strictly smaller than the achievable bound using non-local quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.
In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to show that
in most cases the exponents involved are optimal. The technique we used is a combination of probabilistic tools and of an interpolative approach; this former technique is also employed in this paper to improve the constants for vector-valued Bohnenblust--Hille type inequalities.
We introduce the concept of weak-localization for generalized frames and use this concept to define a class of weakly localized operators. This class contains many important operators, including: Short Time Fourier Transform multipliers, Calderon-Toe
plitz operators, Toeplitz operators on various functions spaces, Anti-Wick operators, and many others. In this paper, we study the boundedness and compactness of weakly localized operators. In particular, we provide a characterization of compactness for weakly localized operators in terms of the behavior of their Berezin transform.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
