Calculation of the number of all pairs of disjoint S-permutation matrices

DOI10.1016/J.AMC.2015.06.054MaRDI QIDQ670673zbMATH OpenOpenAlexFDO

Authors Krasimir Yordzhev

Publication date 18 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphbinary matrixdisjoint matricesS-permutation matrixsudoku matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Abstract: The concept of S-permutation matrix is considered. A general formula for counting all disjoint pairs of $n^{2}imes{n}^2$ S-permutation matrices as a function of the positive integer $n$ is formulated and proven in this paper. To do that, the graph theory techniques have been used. It has been shown that to count the number of disjoint pairs of $n^{2}imes{n}^2$ S-permutation matrices, it is sufficient to obtain some numerical characteristics of all $nimesn$ bipartite graphs.

Recommendations

• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• Bipartite graphs related to mutually disjoint S-permutation matrices
• On the number of disjoint pairs of S-permutation matrices
• On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
• Semi-canonical binary matrices

Cites work

• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• Bipartite graphs related to mutually disjoint S-permutation matrices
• Fractions of permutations. An application to Sudoku
• On the number of disjoint pairs of S-permutation matrices
• On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
• Permutation matrices related to Sudoku
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes

Cited in

(7)

• Bipartite graphs related to mutually disjoint S-permutation matrices
• On an algorithm for receiving sudoku matrices
• On the number of disjoint pairs of S-permutation matrices
• On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
• Unveiling order in chaos: a systematic approach based on graph theory in enumerating Sudoku grids of rank n
• On the cardinality of a factor set of binary matrices
• On the number of mutually disjoint pairs of \(S\)-permutation matrices

This page was built for publication: Calculation of the number of all pairs of disjoint S-permutation matrices

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