Semi-canonical binary matrices
Combinatorics
2015-06-16 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all semi-canonical binary matrices taking into account the number of 1 in each of them. This problem relates to the combinatorial problem of finding all pairs of disjoint S-permutation matrices. In the described algorithm, the bit-wise operations are substantially used.
Keywords
Cite
@article{arxiv.1506.04642,
title = {Semi-canonical binary matrices},
author = {Krasimir Yordzhev},
journal= {arXiv preprint arXiv:1506.04642},
year = {2015}
}
Comments
Sixth International Scientific Conference - FMNS2015, South-West University, Blagoevgrad, Bulgaria, 113 - 124