On sequences of Toeplitz matrices over finite fields

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. (This is a corrected version of the paper published in Linear Algebra and Its Applications 561 \, (2019), 63-80.) 2000 MSC Classification 15A33, 15A57

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…