On the cardinality of a factor set of binary matrices

DOI10.1016/J.LAA.2017.08.017MaRDI QIDQ2406405zbMATH OpenOpenAlexFDO

Authors Krasimir Yordzhev

Publication date 27 September 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2017.08.017

zbMATH Keywords

bipartite graphcanonical binary matrixordered \(n\)-tuple of integerssemi-canonical binary matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Boolean and Hadamard matrices (15B34)

Recommendations

• Calculating the cardinality of some classes of binary matrices using bitwise operations -- a polynomial algorithm
• Semi-canonical binary matrices
• Factor-set of binary matrices and Fibonacci numbers
• Combinatorial properties of some classes of matrices over GF(2)
• Representing equivalence problems for combinatorial objects

Cites work

• Calculation of the number of all pairs of disjoint S-permutation matrices
• scientific article; zbMATH DE number 1805713 (Why is no real title available?)
• scientific article; zbMATH DE number 4043856 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• Parallel concepts in graph theory
• Permutation matrices related to Sudoku

Cited in

(7)

• L-free directed bipartite graphs and echelon-type canonical forms
• Binary factorizations of the matrix of all ones
• Factor-set of binary matrices and Fibonacci numbers
• Semi-canonical binary matrices
• Representing equivalence problems for combinatorial objects
• Calculating the cardinality of some classes of binary matrices using bitwise operations -- a polynomial algorithm
• An almost infinite sites model

This page was built for publication: On the cardinality of a factor set of binary matrices

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