首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The primitive Boolean matrices with the second largest scrambling index by Boolean rank
Authors:Yanling Shao  Yubin Gao
Institution:1. Department of Mathematics, North University of China, Taiyuan, Shanxi, 030051, P.R. China
Abstract:The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A k (A T) k = J, where A T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号