Matrix periods and competition periods of Boolean Toeplitz matrices

DOI10.1016/J.LAA.2023.04.023MaRDI QIDQ6161121zbMATH OpenFDO

Authors Gi-Sang Cheon, Bumtle Kang, Suh-Ryung Kim, Homoon Ryu

Publication date 26 June 2023

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.13652

zbMATH Keywords

\(m\)-step competition graphBoolean matrixcompetition periodmatrix periodToeplitz matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Toeplitz, Cauchy, and related matrices (15B05) Boolean and Hadamard matrices (15B34)

Abstract: In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring $mathbbB=0,1$. Given subsets $S$ and $T$ of $1,ldots,n-1$, an $nimesn$ Toeplitz matrix $A=T_{n}langleS;Tangle$ is defined to have $1$ as the $(i,j)$-entry if and only if $j-iinS$ or $i-jinT$. We show that if $maxS+minTlen$ and $minS+maxTlen$, then $A$ has the matrix period $d/d^{\prime }$ and the competition period $1$ where $d=gcd(s+tmidsinS,tinT)$ and $d^{\prime }=gcd(d,minS)$. Moreover, it is shown that the limit of the matrix sequence ${A^m(A^T{)}^m}_{m=1}^{i}nfty$ 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.

Recommendations

• Competition periods of multipartite tournaments
• Generalized competition index of an irreducible Boolean matrix
• A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
• Characterization of irreducible Boolean matrices with the largest generalized competition index
• On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected

Cites work

• A bound of generalized competition index of a primitive digraph
• Characterization of irreducible Boolean matrices with the largest generalized competition index
• Combinatorial matrix theory
• Competition indices of strongly connected digraphs
• COMPETITION INDICES OF TOURNAMENTS
• Exponents of primitive directed Toeplitz graphs
• Generalized competition index of a primitive digraph
• The \(m\)-step competition graph of a digraph
• The competition index of a nearly reducible Boolean matrix

Cited in

(2)

• Competition periods of multipartite tournaments
• Matrix periods and competition periods of Boolean Toeplitz matrices. II

This page was built for publication: Matrix periods and competition periods of Boolean Toeplitz matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161121)