Related papers: On the joint spectral radius

We prove that the Davenport-Mahler bound holds for arbitrary graphs with vertices on the set of roots of a given univariate polynomial with complex coefficients.

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

We emulate the Rademacher functions on any non-commutative compact group requiring the resulting system to have pairwise disjoint spectra.

We consider a quantity that measures the roundness of a bounded, convex $d$-polytope in $\mathbb{R}^d$. We majorise this quantity in terms of the smallest singular value of the matrix of outer unit normals to the facets of the polytope.

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

Let Pd,n denote the space of all real polynomials of degree at most d on R^n. We prove a new estimate for the logarithmic measure of the sublevel set of a polynomial P in Pd,1. Using this estimate, we prove a sharp estimate for a singular…

We give general spectral and eigenvalue perturbation bounds for a selfadjoint operator perturbed in the sense of the pseudo-Friedrichs extension. We also give several generalisations of the aforementioned extension. The spectral bounds for…

Given a complex Banach space $X$ and a joint spectrum for complex solvable finite dimensional Lie algebras of operators defined on $X$, we extend this joint spectrum to quasi-solvable Lie algebras of operators, and we prove the main…

A counter-example to lower bounds for the singular values of the sum of two matrices in [1] and [2] is given. Correct forms of the bounds are pointed out.

In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…

This article deals with the limiting spectral distribution and joint convergence of reverse circulant and symmetric circulant matrices with independent entries. These results are already proved in articles Bose and Sen (2008)…

We establish an inequality of different metrics for algebraic polynomials.

We show that discrete singular Radon transforms along a certain class of polynomial mappings $P:\mathbb{Z}^d\to \mathbb{Z}^n$ satisfy sparse bounds. For $n=d=1$ we can handle all polynomials. In higher dimensions, we pose restrictions on…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

The competitive spectral radius extends the notion of joint spectral radius to the two-player case: two players alternatively select matrices in prescribed compact sets, resulting in an infinite matrix product; one player wishes to maximize…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…