On the probability of two randomly generated S-permutation matrices to be disjoint

DOI10.1016/J.SPL.2014.04.006zbMATH Open1290.05045arXiv1210.2814OpenAlexW2962953495MaRDI QIDQ2453992FDOQ2453992

Authors: Krasimir Yordzhev 

Publication date: 12 June 2014

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary $n^{2}imes{n}^2$ 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 $n^{2}imes{n}^2$ 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 $n=2$ and $n=3$ are discussed in detail.

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

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

zbMATH Keywords

derangementSudoku\(S\)-permutation matrixdisjoint binary matricesrencontre

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Title not available (Why is that?)
• Fractions of permutations. An application to Sudoku
• Title not available (Why is that?)
• Permutation matrices related to Sudoku
• Bipartite graphs related to mutually disjoint \(S\)-permutation matrices
• On the number of disjoint pairs of S-permutation matrices

Cited In (5)

• Bipartite graphs related to mutually disjoint \(S\)-permutation matrices
• On the number of disjoint pairs of S-permutation matrices
• A new algorithm for enumerating all possible Sudoku squares
• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• 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)