Sharp nonzero lower bounds for the Schur product theorem

نویسندگان

چکیده

By a result of Schur [J. Reine Angew. Math. 140 (1911), pp. 1–28], the entrywise product M ? N M \circ N two positive semidefinite matrices comma , encoding="application/x-tex">M,N is again positive. Vybíral [Adv. 368 (2020), p. 9] improved on this by showing uniform lower bound overbar greater-than-or-equal-to E Subscript n Baseline slash n"> ¯ \to \infty i.e., over infinite-dimensional Hilbert spaces. In note, we affirmatively answer three questions extending refining Vybíral’s lower-bound arbitrary Specifically: provide tight bounds, improving bounds. Second, our proof ‘conceptual’ (and self-contained), providing interpretation these via tracial Cauchy–Schwarz inequalities. Third, extend Hilbert–Schmidt operators. As an application, Open Problem 1 Hinrichs–Krieg–Novak–Vybíral 65 (2021), Paper No. 101544, 20 pp.], which yields improvements in error certain tensor (integration) problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds for Matrix Product

We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two n n matrices over finite fields. In particular we obtain the following results: 1. We show that the number of product gates in any bilinear (or quadratic) circuit that computes the product of two n n matrices over GF (2) is at least 3n2 o(n2). 2. We show that the number of pro...

متن کامل

Sharp lower bounds for the Zagreb indices of unicyclic graphs

The first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices of the respective graph. In this paper we present the lower bound on M1 and M2 among all unicyclic graphs of given order, maximum degree, and cycle length, and characterize graphs for which th...

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

Quasimodes and Resonances: Sharp Lower Bounds

We prove that, asymptotically, any cluster of quasimodes close to each other approximates at least the same number of resonances, counting multiplicities. As a consequence, we get that the counting function of the number of resonances close to the real axis is bounded from below essentially by the counting function of the quasimodes.

متن کامل

Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs

Let G1 and G2 be simple graphs and let n1 = |V (G1)|, m1 = |E(G1)|, n2 = |V (G2)| and m2 = |E(G2)|. In this paper we derive sharp upper and lower bounds for the number of spanning trees τ in the Cartesian product G1 G2 of G1 and G2. We show that: τ(G1 G2) ≥ 2(n1−1)(n2−1) n1n2 (τ(G1)n1) n2+1 2 (τ(G2)n2) n1+1 2 and τ(G1 G2) ≤ τ(G1)τ(G2) [ 2m1 n1 − 1 + 2m2 n2 − 1 ](n1−1)(n2−1) . We also characteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2021

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15555