Abstract
A recurrence matrix is a matrix whose terms are sequential members of a linear homogeneous recurrence sequence of order k and whose dimensions are both greater than or equal to k. In this paper, the ranks of recurrence matrices are determined. In particular, it is shown that the rank of such a matrix differs from the previously found upper bound of k in only two situations: When (a_j) satisfies a recurrence relation of order less than k, and when the nth powers of distinct eigenvalues of (a_j ) coincide.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
