_2(R,S)中的 Parsimonious-矩阵  

Parsimonious-matrices in A 2(R,S)

作　　者：侯素梅[1] 

机构地区：[1]广东工业大学数理系

出　　处：《广东工业大学学报》1999年第1期66-70,共5页Journal of Guangdong University of Technology

摘　　要：设Ａ２（Ｒ，Ｓ）是所有具有指定行和向量Ｒ与列和向量Ｓ的（０，１，２）－矩阵组成的集合．Ａ２（Ｒ，Ｓ）中正元素个数最少的矩阵称为是Ｐａｒｓｉｍｏｎｉｏｕｓ－矩阵．本文主要研究Ａ２（Ｒ，Ｓ）中Ｐａｒｓｉｍｏｎｉｏｕｓ－矩阵的性质，并给出一种找出Ｐａｒｓｉｍｏｎｉｏｕｓ－矩阵的简捷算法．Let A 2(R,s)be the class of all (0,1,2)-matrices with a prescribed row sum vector R and column sum vector S. A (0,1,2)-matrix A in A 2(R,S)is defined to be parsimonious iff A has the smallest number of positive entries amorg all (0,1,2)-matrices in A 2(R,S). We study some properties of parsimonious-matrices and find a way that how to obtain a parsimonious-matrix in A 2(R,S).

关 键 词：矩阵 P矩阵 C矩阵 1-型矩阵 

分 类 号：O151.21[理学—数学]