Abstract

This work examines the concept of S-permutation matrices, namely n2×n2 permutation matrices containing a single 1 in each canonical n×n subsquare (block). The article suggests a formula for counting mutually disjoint pairs of n2×n2S-permutation matrices in the general case by restricting this task to the problem of finding some numerical characteristics of the elements of specially defined for this purpose factor-set of the set of n×n binary matrices. The paper describes an algorithm that solves the main problem. To do that, every n×n binary matrix is represented uniquely as a n-tuple of integers.

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.