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

DOI10.1016/j.spl.2014.04.006zbMath1290.05045arXiv1210.2814OpenAlexW2962953495MaRDI QIDQ2453992

Krasimir Yordzhev

Publication date: 12 June 2014

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

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

zbMATH Keywords

derangementSudoku\(S\)-permutation matrixdisjoint binary matricesrencontre

Mathematics Subject Classification ID

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

Related Items (2)

A new algorithm for enumerating all possible Sudoku squares ⋮ Calculation of the number of all pairs of disjoint S-permutation matrices

Cites Work

• Fractions of permutations. An application to Sudoku
• Permutation matrices related to Sudoku
• Bipartite graphs related to mutually disjoint \(S\)-permutation matrices
• On the number of disjoint pairs of S-permutation matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: On the probability of two randomly generated \(S\)-permutation matrices to be disjoint