Abstract
The number of matrices avoiding certain types of matrices is NP-hard in general. In this paper the binary matrices are considered. In particular, the problem of finding the total number of special binary matrices avoiding some types of 2 × 2 matrices is the main objective of this paper. The solution of the problem is given under some constraints as well as under general situation. The formula for the special binary matrices is obtained for total count of matrices of order n × k and also obtained the formula for special binary matrices avoiding some matrices of order 2 × 2. The formula is obtained in terms of the Catalan numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
