Abstract

The solution to the problem of counting of m X n matrices of zeros and ones under 1) row and columns permutations and 2) row and columns permutations together with columns complementations is given in Harrison's1 paper. The first problem is more complicated than the second one, since the author claims the second is "an easy generalization" of the first.

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 call

Disclaimer: 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.