• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.305-318
• /
• 2019

A sign pattern is a matrix whose entries belong to the set {+, -, 0}. An n-by-n sign pattern ${\mathcal{A}}$ is said to allow an eventually positive matrix or be potentially eventually positive if there exist at least one real matrix A with the same sign pattern as ${\mathcal{A}}$ and a positive integer $k_0$ such that $A^k>0$ for all $k{\geq}k_0$. Identifying the necessary and sufficient conditions for an n-by-n sign pattern to be potentially eventually positive, and classifying the n-by-n sign patterns that allow an eventually positive matrix are two open problems. In this article, we focus on the potential eventual positivity of broom sign patterns. We identify all the minimal potentially eventually positive broom sign patterns. Consequently, we classify all the potentially eventually positive broom sign patterns.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.353-360
• /
• 2002

In this paper we study when a sign pattern matrix A and a sign pattern vector b have the property that the convex hull of the columns of each matrix with sign pattern A contains a vector with sign pattern b. This study generalizes the notion of sign central matrices.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.665-671
• /
• 2000

A matrix whose entries consist of the symbols +.- and 0 is called a sign pattern matrix . In 1994 , Eschenbach gave a graph theoretic characterization of irreducible sign idempotent pattern matrices. In this paper, we give a characterization of reducible sign idempotent matrices. We show that reducible sign idempotent matrices, whose digraph is contained in an irreducible sign idempotent matrix, has all nonnegative entries up to equivalences. this extend the previous result.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.561-573
• /
• 1995

A matrix whose entries consist of the symbols +, - and 0 is called a sign pattern matrix. In [1], a graph theoretic characterization of sign idempotent pattern matrices was given. A question was given for the sign patterns which allow idempotence. We characterized the sign patterns which allow idempotence in the sign idempotent pattern matrices.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.43-53
• /
• 1999

A real $m{\times}n$ matrix A is called an L-matrix if every matrix in its qualitative class has linearly independent rows. Since the number of the sign pattern matrices of the given size is finite, we can list all patterns lexicographically. In [2], a necessary and sufficient condition for a matrix to be an L-matrix was given. We presented an algorithm which decides whether the given matrix is an L-matrix or not. In this paper, we develope an algorithm and C-program which will determine whether a given matrix is an L-matrix or not, or an SNS-matrix or not. In addition, we have extended our algorithm to be able to classify sign-pattern matrices, and to find barely L-matrices from a given matrix and to list all $m{\times}n$ L-matrices.

• Journal of the Korean Mathematical Society
• /
• v.36 no.3
• /
• pp.469-487
• /
• 1999

Sign patterns of idempotent matrices, especially symmetric idempotent matrices, are investigated. A number of fundamental results are given and various constructions are presented. The sign patterns of symmetric idempotent matrices through order 5 are determined. Some open questions are also given.

• Honam Mathematical Journal
• /
• v.28 no.3
• /
• pp.333-342
• /
• 2006

We denote by Q(A) the set of all matrices with the same sign pattern as A. A matrix A is an SN-matrix provided there exists a set S of sign patterns such that the set of sign patterns of vectors in the null-space of A is S, for each A ${\in}$ Q(A). We have a characterization of an SN-matrix related with L-matrix and we analyze the structure of an SN-matrix.

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.27-36
• /
• 1997

A matrix whose entries consist of the symbols +, -, 0 is called a sign-pattern matrix. We characterize the $n \times n$ irreducible sign-pattern matrices that are sign tripotent.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.343-352
• /
• 2006

A real matrix A is called a sign-central matrix if for, every matrix $\tilde{A}$ with the same sign pattern as A, the convex hull of columns of $\tilde{A}$ contains the zero vector. A sign-central matrix A is called a tight sign-central matrix if the Hadamard (entrywise) product of any two columns of A contains a negative component. A real vector x = $(x_1,{\ldots},x_n)^T$ is called stable if $\|x_1\|{\leq}\|x_2\|{\leq}{\cdots}{\leq}\|x_n\|$. A tight sign-central matrix is called a $tight^*$ sign-central matrix if each of its columns is stable. In this paper, for a matrix B, we characterize those matrices C such that [B, C] is tight ($tight^*$) sign-central. We also construct the matrix C with smallest number of columns among all matrices C such that [B, C] is $tight^*$ sign-central.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.465-473
• /
• 1998

A real m $\times$ n matrix A is semipositive (SP) if there is a vector x $\geq$ 0 such that Ax > 0, inequalities being entrywise. A is minimally semipositive (MSP) if A is semipositive and no column deleted submatrix of A is semipositive. We give a necessary and sufficient condition for the sign pattern matrix with n positive entries to be minimally semipositive.