Related papers: Sharp Inequalities for Schur-Convex Functionals of…
Generalized torical band inequalities give precise upper bounds for the width of compact manifolds with boundary in terms of positive pointwise lower bounds for scalar curvature, assuming certain topological conditions. We extend several…
We consider the task of minimizing the sum of convex functions stored in a decentralized manner across the nodes of a communication network. This problem is relatively well-studied in the scenario when the objective functions are smooth, or…
In this paper, we establish the sharp critical and subcritical trace Trudinger-Moser and Adams inequalities on the half spaces and prove the existence of their extremals through the method based on the Fourier rearrangement, harmonic…
Incomplete U-statistics have been proposed to accelerate computation. They use only a subset of the subsamples required for kernel evaluations by complete U-statistics. This paper gives a finite sample bound in the style of Bernstein's…
We consider the averages of a function $ f$ on $ \mathbb R ^{n}$ over spheres of radius $ 0< r< \infty $ given by $ A_{r} f (x) = \int_{\mathbb S ^{n-1}} f (x-r y) \; d \sigma (y)$, where $ \sigma $ is the normalized rotation invariant…
We derive quantitative bounds for eigenvalues of complex perturbations of the indefinite Laplacian on the real line. Our results substantially improve existing results even for real-valued potentials. For $L^1$-potentials, we obtain optimal…
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical…
We consider the semi-classical expansion of the Bunch-Davies wavefunction with future boundary condition in position space for a real scalar field, conformally coupled to a classical de Sitter background in the expanding Poincar\'e patch…
We present a unified, SI-consistent framework to constrain minimal SME coefficients $a_\mu$ and $b_\mu$ using magnetically confined two-dimensional electron systems under a uniform magnetic field. Working in the nonrelativistic…
We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…
In this paper, we study the properties of Connes spectral distances between quantum states under unitary transformations. We mainly focus on spectral triples with matrix algebras acting on finite dimensional Hilbert spaces via some linear…
We sharpen the moment comparison inequalities with sharp constants for sums of random vectors uniform on Euclidean spheres, providing a deficit term (optimal in high dimensions).
For a positive linear map F and a normal matrix N, we show that |F(N)| is bounded by some simple linear combinations in the unitary orbit of F(|N|). Several elegant sharp inequalities are derived, especially for the Schur product.
In this paper, we extend the classical Bohr's inequality to the setting of the non-commutative Hardy space $H^1$ associated with a semifinite von Neumann algebra. As a consequence, we obtain Bohr's inequality for operators in the von…
Leveraging tools from convex analysis and incorporating additional singular value information of matrices, we completely resolve the problem of establishing perturbation bounds for the Frobenius norm of subunitary and positive polar…
In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a…
Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…
We optimize the running time of the primal-dual algorithms by optimizing their stopping criteria for solving convex optimization problems under affine equality constraints, which means terminating the algorithm earlier with fewer…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…