On sequences of Toeplitz matrices over finite fields
Geoffrey Price, Myles Wortham

TL;DR
This paper investigates the nullity patterns of sequences of Toeplitz matrices over finite fields, providing counting formulas and an elementary proof related to the number of such matrices with specified rank.
Contribution
It introduces a detailed analysis of nullity sequences of Toeplitz matrices over finite fields and offers a new elementary proof for counting matrices of a given rank.
Findings
Derived formulas for counting Toeplitz matrices with specific nullity patterns
Established a connection between nullity patterns and matrix rank over finite fields
Provided an elementary proof for the enumeration of Toeplitz matrices of any given rank
Abstract
For each non-negative integer let be an by Toeplitz matrix over a finite field, , and suppose for each that is embedded in the upper left corner of . We study the structure of the sequence , where is the nullity of . For each and each nullity pattern , we count the number of strings of Toeplitz matrices with this pattern. As an application we present an elementary proof of a result of D. E. Daykin on the number of Toeplitz matrices over of any specified rank. (This is a corrected version of the paper published in Linear Algebra and Its Applications \, .) 2000 MSC Classification 15A33, 15A57
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
