Construction of sign k-potent sign patterns and conditions for such sign patterns to allow k-potence

TL;DR

This paper introduces new algorithms for constructing sign k-potent sign patterns and provides conditions under which these patterns exhibit k-potence, improving upon previous methods that lacked guaranteed termination.

Contribution

The paper presents a novel single-iteration algorithm for constructing sign idempotent patterns and an algorithm for sign k-potent patterns, along with conditions for k-potence.

Findings

New algorithms guarantee single-iteration construction of sign idempotent patterns.

Conditions for a sign pattern to allow k-potence are established.

Examples demonstrate the effectiveness and limitations of the algorithms.

Abstract

A sign pattern is a matrix whose entries are from the set $\{+,-, 0\}$. A square sign pattern $A$ is called sign $k$-potent if $k$ is the smallest positive integer for which $A^{k+1}=A$, and for $k=1$, $A$ is called sign idempotent. In 1993, Eschenbach \cite{01} gave an algorithm to construct sign idempotent sign patterns. However, Huang \cite{02} constructed an example to show that matrices obtained by Eschenbach's algorithm were not necessarily sign idempotent. In \cite{03}, Park and Pyo modified Eschenbach's algorithm to construct all reducible sign idempotent sign patterns. In this paper, we give an example to establish that the modified algorithm by Park and Pyo does not always terminate in a single iteration; the number of iterations, depending on the order of the sign pattern, could be large. In this paper, we give a new algorithm that terminates in a single iteration to construct all possible sign idempotent sign patterns. We also provide an algorithm for constructing sign $k$-potent sign patterns. Further, we give some necessary and sufficient conditions for a sign $k$-potent sign pattern to allow $k$-potence.