Abstract
For each non-negative integer n let An be an n+1 by n+1 Toeplitz matrix over a finite field, F, and suppose for each n that An is embedded in the upper left corner of An+1. We study the structure of the sequence ν={νn:n∈Z+}, where νn=null(An) is the nullity of An. For each n∈Z+ and each nullity pattern ν0,ν1,…,νn, we count the number of strings of Toeplitz matrices A0,A1,…,An with this pattern. As an application we present an elementary proof of a result of D. E. Daykin on the number of n×n Toeplitz matrices over GF(2) of any specified rank.
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.
