On the probability of two randomly generated S-permutation matrices to be disjoint
From MaRDI portal
Publication:2453992
Abstract: The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary S-permutation matrix, a lower band of the number of all disjoint with it S-permutation matrices is found. A formula for counting a lower band of the number of all disjoint pairs of S-permutation matrices is formulated and proven. As a consequence, a lower band of the probability of two randomly generated S-permutation matrices to be disjoint is found. In particular, a different proof of a known assertion is obtained in the work. The cases when and are discussed in detail.
Recommendations
- On the number of mutually disjoint pairs of \(S\)-permutation matrices
- On the number of disjoint pairs of S-permutation matrices
- scientific article; zbMATH DE number 1549030
- The distribution of permutation matrix entries under randomized basis
- Construction and properties of a class of random d-disjunct matrices
- The distribution of eigenvalues of randomized permutation matrices
- Random permutation matrices under the generalized Ewens measure
- Calculation of the number of all pairs of disjoint S-permutation matrices
- scientific article; zbMATH DE number 1893705
- Random matrices. I: Combinatorial problems
Cites work
- Bipartite graphs related to mutually disjoint S-permutation matrices
- Fractions of permutations. An application to Sudoku
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 1805713 (Why is no real title available?)
- On the number of disjoint pairs of S-permutation matrices
- Permutation matrices related to Sudoku
Cited in
(5)- Bipartite graphs related to mutually disjoint S-permutation matrices
- On the number of mutually disjoint pairs of \(S\)-permutation matrices
- On the number of disjoint pairs of S-permutation matrices
- A new algorithm for enumerating all possible Sudoku squares
- Calculation of the number of all pairs of disjoint S-permutation matrices
This page was built for publication: On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453992)