|
|
A326343
|
|
Number of inequivalent n X n binary matrices with total support, where equivalence means permutations of rows or columns.
|
|
2
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A nonnegative matrix has total support if it is nonzero and for every positive entry there exists a permutation of the columns such that the positive entry is a diagonal entry afterwards and all diagonal entries are positive afterwards.
Number of inequivalent n X n binary matrices generated by applying the sign function on the entries of a doubly stochastic n X n matrix. - [R. Sinkhorn and P. Knopp (1967)]
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 2 the a(2) = 2 matrices are:
[1 1] [1 0]
[1 1], [0 1].
|
|
CROSSREFS
|
A326342 additionally considers equivalent matrices.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|