On rational circulants satisfying A^ m=dI+ J
Let I denote the identity matrix of order \(\nu\), and J the matrix of order \(\nu\) with every entry equal to 1. A circulant is a special matrix of order \(\nu\) in which each row (except the first) is obtained from the preceding row by shifting the elements cyclically one column to the right. In the paper under review the author proves the following main result. Theorem. Let d and \(\lambda\) be rational numbers. Then the necessary and sufficient conditions for the existence of a rational circulant of order \(\nu >1\) satisfying the matrix equation \(A^ m=dI+\lambda J\) are (i) \(d+\lambda \nu\) is a rational m-th power, and (ii) d is a rational m-th power unless m is even and \(\nu\) is a power of an odd prime p, in which case, d can also be the product of a rational m-th power with the (m/2)- th power of \((-1)^{(p-1)/2}p\).
- A generalization of the matrix equation A^ 2=J
- Cyclic difference sets
- scientific article; zbMATH DE number 3392542 (Why is no real title available?)
- scientific article; zbMATH DE number 3186965 (Why is no real title available?)
- Notes on central groupoids
- On rational circulants satisfying \(A^2=dI+\lambda J\)
- On some solutions of A^k=dI+ J
- On the \(g\)-circulant solutions to the matrix equation \(A^m=\lambda J\)
- On the matrix equation A^m= J
- The g-circulant solutions of \(A^ m=\lambda J\)
- Difference sets in dihedral groups
- Nonexistence of certain perfect arrays
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Rectangular groupoids and related structures
- Circulative Matrices of Degree \theta
- Orderly algorithm to enumerate central groupoids and their graphs
This page was built for publication: On rational circulants satisfying \(A^ m=dI+\lambda J\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800985)
