Semi-canonical binary matrices

MaRDI QIDQ3456077zbMATH OpenFDO

Authors Krasimir Yordzhev

Publication date 11 December 2015

Full work available at URL https://arxiv.org/abs/1506.04642

zbMATH Keywords

binary matricescanonical binary matricesordered \(n\)-tuples, disjoint S-permutation matricessemicanonical binary matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Special matrices (15B99) Theory of programming languages (68N15)

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.

Recommendations

• Calculating the cardinality of some classes of binary matrices using bitwise operations -- a polynomial algorithm
• On the cardinality of a factor set of binary matrices
• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• Binary matrices
• On the number of disjoint pairs of S-permutation matrices

Cited in

(5)

• Binary matrices
• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• On the cardinality of a factor set of binary matrices
• Calculating the cardinality of some classes of binary matrices using bitwise operations -- a polynomial algorithm
• Calculation of the number of all pairs of disjoint S-permutation matrices

This page was built for publication: Semi-canonical binary matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3456077)