相关论文: On the spectra of $g$-circulant matrices and appli…

A square matrix of order $n$ with $n\geq 2$ is called a \textit{permutative matrix} or permutative when all its rows (up to the first one) are permutations of precisely its first row. In this paper, the spectra of a class of permutative…

In this study, we present a new generalization of circulant matrices for the generalized $k$-Horadam numbers, by considering the $g$-circulant matrix $C_{n,g}(H)=g -circ(H_{k,1},H_{k,2},\ldots ,H_{k,n})$. Also, we calculate the spectral…

Given a circulant matrix $\mathrm{circ}(c,a,0,0,...,0,a)$, $a\ne 0$, of order~$n$, we ``border'' it from left and from above by constant column and row, respectively, and we set the left top entry to be $-nc$. This way we get a~particular…

In this paper we deal with circulant and partitioned into $n$-by-$n$ circulant blocks matrices and introduce spectral results concerning this class of matrices. The problem of finding lists of complex numbers corresponding to a set of…

This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

We consider the problem of reconstruction of an $n\times n$ matrix with coefficients depending rationally on $x\in \mathbb P^1$ from the data of: (a) its characteristic polynomial and (b) a line bundle of degree $g+n-1$, with $g$ the…

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…

The spectral properties of a class of band matrices are investigated. The reconstruction of matrices of this special class from given spectral data is also studied. Necessary and sufficient conditions for that reconstruction are found. The…

Our approach to structural matrix rings defines them over preordered directed graphs. A grading of a structural matrix ring is called a good grading if its standard unit matrices are homogeneous. For a group $G$, a $G$ -grading set is a set…

A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…

We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…

The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…

The inverse eigenvalue problem of a graph $G$ aims to find all possible spectra for matrices whose $(i,j)$-entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. In this work, the inverse eigenvalue problem is completely…

A permutative matrix is a square matrix such that every row is a permutation of the first row. A circulant matrix is a matrix where each row is a cyclic shift of the row above to the right. The Guo's index $\lambda_0$ of a realizable list…

We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…

We show that if a list of nonzero complex numbers $\sigma=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is the nonzero spectrum of a diagonalizable nonnegative matrix, then $\sigma$ is the nonzero spectrum of a diagonalizable nonnegative matrix…