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 number of mutually disjoint pairs of S-permutation matrices (1604.02712v2)

Published 10 Apr 2016 in math.CO and cs.DM

Abstract: This work examines the concept of S-permutation matrices, namely $n2 \times n2$ permutation matrices containing a single 1 in each canonical $n \times n$ subsquare (block). The article suggests a formula for counting mutually disjoint pairs of $n2 \times n2$ S-permutation matrices in the general case by restricting this task to the problem of finding some numerical characteristics of the elements of specially defined for this purpose factor-set of the set of $n \times n$ binary matrices. The paper describe an algorithm that solves the main problem. To do that, every $n\times n$ binary matrix is represented uniquely as a n-tuple of integers.

Citations (1)

Summary

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