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 n2imesn2 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 n2imesn2 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.












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)