Related papers: Universal Bound on the Eigenvalues of 2-Positive T…
Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana Theorem to hypergraphs.
About 20 years ago, J-P.~Serre announced a bound on the trace of elements of compact Lie groups under the adjoint representation together with related results, provided indications of his proofs, and invited a better proof. This note…
Let (G,w) be a weighted graph. The necessary and sufficient conditions under which a weight w : E(G)-->R^+ can be extended to a pseudoultrametric on V(G) are found. A criterion of the uniqueness of this extension is also obtained. It is…
Let $A = [a_{i j}]_{i,j=1}^n$ be a nonnegative matrix with $a_{1 1} = 0$. We prove some lower bounds for the spread $s(A)$ of $A$ that is defined as the maximum distance between any two eigenvalues of $A$. If $A$ has only two distinct…
The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…
Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a sufficient condition for a positive map to be exposed. This is an analog of a spanning property which guaranties that a positive map is optimal.…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We review the classification of positive extremal traces on the generic infinite Temperley-Lieb algebra, and then extend the classification to the non-semisimple root of unity case. As a result, we obtain Hilbert space structures on the…
A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the…
Motivated by recent progress in quantum information theory, this article aims at optimizing trace polynomials, i.e., polynomials in noncommuting variables and traces of their products. A novel Positivstellensatz certifying positivity of…
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…
We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
We show how positive unital linear maps can be used to obtain some bounds for the eigenvalues of nonnegative matrices.
This article introduces a trace-based metric on the space of positive semi-definite (PSD) tensors, offering a geometric perspective that connects their algebraic structure to their intrinsic geometric properties. It defines the…
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…
We prove Lieb-Thirring inequalities with improved constants on the two-dimensional sphere and the two-dimensional torus. In the one-dimensional periodic case we obtain a simultaneous bound for the negative trace and the number of negative…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
It is well known from the Perron-Frobenius theory that the spectral gap of a positive square matrix is positive. In this paper, we give a more quantitative characterization of the spectral gap. More specifically, using a complex extension…
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…