Determinants and Inverses of banded Toeplitz Matrices over $\mathbb{F}_p$ Are Periodic
Chen Wang, Chao Wang

TL;DR
This paper proves that determinants and inverses of banded Toeplitz matrices over finite fields are periodic, providing algorithms for efficient computation of these properties, which is a novel contribution in the field.
Contribution
The paper introduces the first proof of periodicity for determinants and inverses of banded Toeplitz matrices over p, along with efficient algorithms for their computation.
Findings
Determinants and inverses are periodic with a computable period P(f).
The period P(f) is bounded by p^{k-1}-1, independent of matrix order.
Algorithms for determinant and inverse computation run in polynomial time.
Abstract
Banded Toeplitz matrices over , as a well-known class of matrices, have been extensively studied in the fields of coding theory and automata theory. In this paper, we discover that both determinants and inverses of banded Toeplitz matrices over exhibit periodicity. For a Toeplitz matrix with bandwidth , The period is related to the parameters on the band and is independent of the order, with an upper limit of . We provide an algorithm which can compute the determinant of any order banded Toeplitz matrix within . And its inverse can be represented by three submatrices of size located respectively on the diagonal, above the diagonal, and below the diagonal. Thus, the computational cost for calculating the inverse is fixed, and our algorithm can solve it within . This is the first time that the…
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
TopicsAdvanced Mathematical Theories and Applications · Matrix Theory and Algorithms · Graph theory and applications
