Matrix periods and competition periods of Boolean Toeplitz matrices II

Abstract

This paper is a follow-up to the paper [Matrix periods and competition periods of Boolean Toeplitz matrices, Linear Algebra Appl. 672:228--250, (2023)]. 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. In the previous paper, we have shown that the matrix period and the competition period of Toeplitz matrices A=Tn S; T satisfying the condition () S+ T n and S+ T n are d+/d and 1, respectively, where d+= (s+t s ∈ S, t ∈ T) and d = (d, S). In this paper, we claim that even if () is relaxed to the existence of elements s ∈ S and t ∈ T satisfying s+t n and (s,t)=1, the same result holds. There are infinitely many Toeplitz matrices that do not satisfy () but the relaxed condition. For example, for any positive integers k, n with 2k+1 n, it is easy to see that Tn k, n-k;k+1, n-k-1 does not satisfies () but satisfies the relaxed condition. Furthermore, we show that the limit of the matrix sequence \Am(AT)m\m=1∞ is Tn d+,2d+, …, n/d+ d+.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…