Related papers: A Note On The Spectral Norms of The Matrices Conne…
Linear electromagnetic wave scattering systems can be characterized by an impedance matrix that relates the voltages and currents at the ports of the system. When the system size becomes greater than the wavelength of the fields involved,…
Speckle patterns are used in a broad range of applications including microscopy, imaging, and light-matter interactions. Tailoring speckles' statistics can dramatically enhance their performance in applications. We present an experimental…
We compute the spectral density for ensembles of of sparse symmetric random matrices using replica, managing to circumvent difficulties that have been encountered in earlier approaches along the lines first suggested in a seminal paper by…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
Using the language of Riordan arrays, we look at two related iterative processes on matrices and determine which matrices are invariant under these processes. In a special case, the invariant sequences that arise are conjectured to have…
Kernel matrices are a key quantity in kernel-based approximation, and important properties such as stability and algorithmic convergence can be analyzed with their help. In this work we refine a multivariate Ingham-type theorem, which is…
We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as…
The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…
Explicit formulae are given for the nine possible induced matrix norms corresponding to the 1-, 2-, and $\infty$-norms for Euclidean space. The complexity of computing these norms is investigated.
We study the spectral norm of N-dimensional hermitian random matrices whose entries are zero outside of the band of the width b along the principal diagonal. Inside this band the elements are given by gaussian centered jointly independent…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
In their recent paper "The spectral norm of a Horadam circulant matrix", Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the spectral norm of a general real circulant matrix ${\bf C}$ equals the modulus of its…
We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…
In a previous paper we completely described cyclotomic matrices--integer symmetric matrices of spectral radius at most 2. In this paper we find all minimal noncyclotomic matrices. As a consequence, we are able to determine all integer…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…