The necessary condition for eigenvalue values of a circulant matrix is studied It is then proved that the necessary condition also su ces the existence of a circulant matrix with the prescribed eigenvalue values Introduction An n n matrix C of the form C c c cn cn c c cn cn cn c cn c c cn c is called a circulant matrix As each row of a circulant matrix is just the previous row cycled forward on...

In this paper, we use the algebra methods, the properties of the r-circulant matrix and the geometric circulant matrix to study the upper and lower bound estimate problems for the spectral norms of a geometric circulant matrix involving the generalized k-Horadam numbers, and we obtain some sharp estimations for them. We can also give a new estimation for the norms of a r-circulant matrix involv...

We estimate the norms of standard Gaussian random Toeplitz and circulant matrices and their inverses, mostly by means of combining some basic techniques of linear algebra. In the case of circulant matrices we obtain sharp probabilistic estimates, which show that these matrices are expected to be very well conditioned. Our probabilistic estimates for the norms of standard Gaussian random Toeplit...

A circulant matrix of order n is the matrix of convolution by a fixed element of the group algebra of the cyclic group Zn. Replacing Zn by an arbitrary finite group G gives the class of matrices that we call G-circulant. We determine the eigenvalues of such matrices with the tools of representation theory and the non-abelian Fourier transform. Definition 1 An n by n matrix C is circulant if the...

In this paper, fast algorithms for solving RFPrLR circulant linear systems are presented by the fast algorithm for computing polynomials. The unique solution is obtained when the RFPrLR circulant matrix over the complex field C is nonsingular, and the special solution and general solution are obtained when the RFPrLR circulant matrix over the complex field C is singular. The extended algorithms...

for a symmetric group $g:=sym(n)$ and a conjugacy class $mathcal{x}$ of involutions in $g$, it is known that if the class of involutions does not have a unique fixed point, then - with a few small exceptions - given two elements $a,x in mathcal{x}$, either $angbrac{a,x}$ is isomorphic to the dihedral group $d_{8}$, or there is a further element $y in mathcal{x}$ such that $angbrac{a,y} cong ang...

Introduced the notion of symmetric circulant matrix on skew field, an easy method is given to determine the inverse of symmetric circulant matrix on skew field , with this method , we derived the formula of determine inverse about several special type of symmetric circulant matrix. Mathematics Subject Classification: 05A19, 15A15

In signal acquisition, Toeplitz and circulant matrices are widely used as sensing operators. They correspond to discrete convolutions and are easily or even naturally realized in various applications. For compressive sensing, recent work has used random Toeplitz and circulant sensing matrices and proved their efficiency in theory, by computer simulations, as well as through physical optical exp...

a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graphG of order n is a Cayley graph over the cyclic groupZn: Equivalently, G is circulant i its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent con guration A and, in particular, a S...