Related papers: Universal Bound on the Eigenvalues of 2-Positive T…
An upper bound on the trace function of a hypergraph $H$ is derived and its applications are demonstrated. For instance, a new upper bound for the VC dimension of $H$, or $vc(H)$, follows as a consequence and can be used to compute $vc(H)$…
Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse…
Completely positive and trace preserving (CPT) maps are important for Quantum Information Theory, because they describe a broad class of of transformations of quantum states. There are also two other related classes of maps, the unital…
The question whether an operator belongs to the domain of some singular trace is addressed, together with the dual question whether an operator does not belong to the domain of some singular trace. We show that the answers are positive in…
When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…
We constrain the low-energy spectra of Laplace operators on closed hyperbolic manifolds and orbifolds in three dimensions, including the standard Laplace-Beltrami operator on functions and the Laplacian on powers of the cotangent bundle.…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
We construct approximate transport maps for perturbative several-matrix models. As a consequence, we deduce that local statistics have the same asymptotic as in the case of independent GUE or GOE matrices, i.e., they are given by the…
In this article, we obtain a super-exponential rate of convergence in total variation between the traces of the first $m$ powers of an $n\times n$ random unitary matrices and a $2m$-dimensional Gaussian random variable. This generalizes…
In this paper, we prove a trace inequality $\text{Tr}[ f(A) A^s B^s ] \leq \text{Tr}[ f(A) (A^{1/2} B A^{1/2} )^s ]$ for any positive and monotone increasing function $f$, $s\in[0,1]$, and positive semi-definite matrices $A$ and $B$. On the…
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…
Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…
Consider fixed and bounded trace Gaussian orthogonal, unitary and symplectic ensembles, closely related to Gaussian ensembles without any constraint. For three restricted trace Gaussian ensembles, we prove universal limits of correlation…
New positivity bounds are derived for generalized (off-forward) parton distributions using the impact parameter representation. These inequalities are stable under the evolution to higher normalization points. The full set of inequalities…
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…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
We prove a certain upper bound for the number of negative eigenvalues of the Schr\"{o}dinger operator on the plane.
We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…
We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…