Related papers: Combinatorial methods for the spectral p-norm of h…

We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach is based on a search for an SOS polynomial that proves…

We study the moduli space of the spectral curves $y^2=W'(z)^2+f(z)$ which characterize the vacua of $\mathcal{N}=1$ U(n) supersymmetric gauge theories with an adjoint Higgs field and a polynomial tree level potential $W(z)$. It is shown…

Using the Hilbert-Schmidt theorem, we reformulate the R-matrix theory in terms of a uniformly and absolutely convergent expansion. Term by term differentiation is possible with this expansion in the neighborhood of the surface. Methods for…

Let $\lambda^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $\Delta$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow…

We prove an elementary formula about the average expansion of certain products of 2 by 2 matrices. This permits us to quickly re-obtain an inequality by M. Herman and a theorem by Dedieu and Shub, both concerning Lyapunov exponents. Indeed,…

Let $\mathbb{A}=\left( \begin{array}{cc} A & 0 \\ 0 & A \\ \end{array} \right)$ be the $2\times2$ diagonal operator matrix determined by a positive bounded operator $A$. For semi-Hilbertian operators $X$ and $Y$, we first show that…

We give an effective bound of the joint spectral radius $\rho(\Sigma)$ for a finite set $\Sigma$ of nonnegative matrices: For every $n$, \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots…

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

We introduce the new concepts of pseu\-do numerical range for operator functions and families of sesquilinear forms as well as the pseu\-do block numerical range for $n \times n$ operator matrix functions. While these notions are new even…

Suppose that c is a linear operator acting on an n-dimensional complex Hilbert Space H, and let tau denote the normalized trace on B(H). Set b_1 = (c+c*)/2 and b_2 = (c-c*)/2i, and write B for the the spectral scale of {b_1, b_2} with…

In this paper, we study the convergence of the spectral embeddings obtained from the leading eigenvectors of certain similarity matrices to their population counterparts. We opt to study this convergence in a uniform (instead of average)…

We prove a formula for the degrees of Ikeda and Naruse's $P$-Grothendieck polynomials using combinatorics of shifted tableaux. We show this formula can be used in conjunction with results of Hamaker, Marberg, and Pawlowski to obtain an…

The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…

Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs. All minors of the Laplacian resulting from an integer matrix…

In various problems of control theory, non-autonomous and multivalued dynamical systems, wavelet theory and other fields of mathematics information about the rate of growth of matrix products with factors taken from some matrix set plays a…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We consider an ensemble of nxn real symmetric random matrices A whose entries are determined by independent identically distributed random variables that have symmetric probability distribution. Assuming that the moment 12+2delta of these…

Cecotti and Vafa proposed in 1993 a beautiful idea how to associate spectral numbers $\alpha_1,...,\alpha_n\in{\mathbb R}$ to real upper triangular $n\times n$ matrices $S$ with 1's on the diagonal and eigenvalues of $S^{-1}S^t$ in the unit…