|
|
A332637
|
|
The number of n X n replace matrices: binary matrices A where the i-th row contains exactly i zeros and A[i,j] >= A[j,i] for all i < j.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Defined in Felsner, Definition 2.
|
|
LINKS
|
|
|
FORMULA
|
According to [Felsner, Theorem 2] the number is at most 2^(0.6974*n^2) for large n.
|
|
EXAMPLE
|
For n = 3, all nine 0-1-matrices with the correct number of zeros and ones in each row are replace matrices except
[ 1 0 1 ]
A = [ 1 0 0 ]
[ 0 0 0 ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|