The Minimum Norm of Solutions of the Boolean Matrix-Equation A~k=J.pdfVIP

Journal of Southeast Un iversity( English E dition) 　　 ec . 　199 8　V ol . 14　N o .2 　 ISSN 1003 —79 85 The Minimum Norm of Solutions of the Boolean k ＊ Ma trix- Equa tion A = J ＊＊ Miao Zhengke ( epar tment of Math emat ics, Xuzhou Normal University , Xu zh ou 22 1009) Ab str act : 　Let A be an n ×n primitive Boolean matrix . γ( A) is the least numb er k su ch k that A = J . σ( A) is th e number of 1- entry in A . I n thi s paper , we con sider th e p aramet er ′ k ′ M ( k , n) = min { σ( A) | A = J , trace( A) = 0} and obt ain the valu es of M ( 2 , n) an d ′ 2 M ( k , n ) for k ≥2n - 6 . Furthermore , the characterizat ion of solution of A = J w ith trace( A) = 0 and σ( A) = 3 n - 3 is complet ely det ermin ed . Key word s : 　primitiv e digraph , primitive matrix , exponent , norm Let B = {0 , 1} be t he usual bin ary Boolean algebra . The m at rices over B are called Boolean mat rices . An n ×n Boolean matrix A is called a primi tive mat rix if there exists a positive integer k k su ch t hat A = J ( wh ere J is the univer sal mat rix) . The least such k is called th e exponent of A , denoted by γ( A) . In projective plane th eory , a