Abstract
In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring B={0,1}. Given subsets S and T of {1,…,n−1}, an n×n Toeplitz matrix A=Tn〈S;T〉 is defined to have 1 as the (i,j)-entry if and only if j−i∈S or i−j∈T. We show that if maxS+minT≤n and minS+maxT≤n, then A has the matrix period d/d′ and the competition period 1 where d=gcd(s+t|s∈S,t∈T) and d′=gcd(d,minS). Moreover, it is shown that the limit of the matrix sequence {Am(AT)m}m=1∞ is a directed sum of matrices of all ones except zero diagonal. In many literatures we see that graph theoretic method can be used to prove strong structural properties about matrices. Likewise, we develop our work from a graph theoretic point of view.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.