Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 10 Oct 2012 in math.CO and cs.DM

Abstract: The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary $n2 \times n2$ 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 $n2 \times n2$ 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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.