Matrix periods and competition periods of Boolean Toeplitz matrices

In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring $\mathbb{B}=\{0,1\}$. Given subsets $S$ and $T$ of $\{1,\dots ,n-1\}$, an $n\times n$ Toeplitz matrix $A=T_n⟨S;T⟩$ is defined to have $1$ as the $(i,j)$-entry if and only if $j-i\in S$ or $i-j\in T$. We show that if $\max S+\min T\le n$ and $\min S+\max T\le n$, then $A$ has the matrix period $d\mathrm{/}{d}^{\mathrm{\prime }}$ and the competition period $1$ where $d=\gcd (s+t\mid s\in S,t\in T)$ and $d^{\mathrm{\prime }}=\gcd (d,\min S)$. Moreover, it is shown that the limit of the matrix sequence $\{A^m(A^T{)}^m{\}}_{m=1}^{\mathrm{\infty }}$ 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.