본문 바로가기
KERD
논문KCI 등재

A note on the square possible sign pattern matices

2

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류수학

초록

A sign pattern matrix A is called a square possible if A^2does not contain an ambiguous entry. In this paper, we investigated the structure of square possible sign pattern matrices, and we make an algorithm to determine whether a sign pattern matrix is square possible or not.

Abstract

A sign pattern matrix A is called a square possible if A^2does not contain an ambiguous entry. In this paper, we investigated the structure of square possible sign pattern matrices, and we make an algorithm to determine whether a sign pattern matrix is square possible or not.

참고문헌 (8)

  1. A. Berman, "Sign patterns that allow eventual positivity", Electronic Journal of Linear Algebra, 19, pp.108~120 (2010)
  2. E. M. Ellison, "Sign patterns that require eventual positivity or require eventual nonnegativity", Electronic Journal of Linear Algebra, 19, pp.98~107 (2010)
  3. C. A. Eschenbach, "Idempotence for sign pattern matrices", Linear Algebra Appl, 180, pp.153~165 (1993)
  4. C. A. Eschenbach, "Self-inverse sign patterns", IMA Vol. Math. Appl, 190, pp.169~179 (1993)
  5. C. A. Eschenbach, "The graph of the unambiguous entries in the product of two (+,-) sign pattern matrices", Linear Algebra Appl, 260, pp.95~118 (1997)
  6. H. Minc, "Nonnegative matrices" (1988), Wiley
  7. J. Stuart, "Irreducible sign k-potent sign pattern matrices", Linear Algebra Appl, 294, pp.85~92 (1999)
  8. J. Stuart, "Reducible sign k-potent sign pattern matrices", Linear Algebra Appl, 294, pp.197~211 (1999)

관련 논문AI추천

이 간행물의 다른 논문 (15건)