Related papers: Sharp Inequalities for Schur-Convex Functionals of…
The inverse tangent function can be bounded by different inequalities, for example by Shafer's inequality. In this publication, we propose a new sharp double inequality, consisting of a lower and an upper bound, for the inverse tangent…
For convex univalent functions we give instances where the sharp bound for various coefficient functionals are identical to those for the corresponding bound for the inverse function. We give instances where the sharp bounds differ and also…
We prove a spectral upper bound for the torsion function of symmetric stable processes that holds for convex domains in $\mathbb{R}^d$. Our bound is explicit and captures the correct order of growth in $d$, improving upon the existing…
Subject to suitable boundary conditions being imposed, sharp inequalities are obtained on integrals over a region $\Omega$ of certain special quadratic functions $f(\bf{E})$ where $\bf{E}(\bf{x})$ derives from a potential $\bf{U}(\bf{x})$.…
Maximal quantum $f$-divergences, defined via the commutant Radon--Nikodym derivative, form a fundamental class of distinguishability measures for quantum states associated with operator convex functions. In this paper, we study the…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical…
We develop a sharp boundary trace theory in arbitrary bounded Lipschitz domains which, in contrast to classical results, allows "forbidden" endpoints and permits the consideration of functions exhibiting very limited regularity. This is…
In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering,…
We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…
Reversing unitary operations is a key task in quantum computing and quantum control. In this work, we introduce and develop the framework of shadow unitary inversion, a relaxed variant of unitary inversion in which the goal is to reproduce…
Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…
This paper is devoted to the investigation of multidimensional analogues of refined Bohr-type inequalities for bounded holomorphic mappings on the unit polydisc $\mathbb{P}\Delta(0;1_n)$. We provide a definitive resolution to the Bohr…
Given an unbalanced open quantum graph, we derive a formula relating sums over its scattering resonances with integrals outside a strip. We deduce lower bounds on the number of resonances (in bounded regions of the complex plane),that are…
This work explores the spectra of quantum graphs where the Schr\"odinger operator on the edges is equipped with a potential. The scattering approach, which was originally introduced for the potential free case, is extended to this case and…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
We prove sharp bounds on eigenvalues of the Laplacian that complement the Faber--Krahn and Luttinger inequalities. In particular, we prove that the ball maximizes the first eigenvalue and minimizes the spectral zeta function and heat trace.…
The research on spectral inequalities for discrete Schrodinger Operators has proved fruitful in the last decade. Indeed, several authors analysed the operator's canonical relation to a tridiagonal Jacobi matrix operator. In this paper, we…
We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…
We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…