All Questions
8 questions
7
votes
1
answer
388
views
Questions on symmetric Hadamard matrices
Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal.
If $A$ is a symmetric matrix, then $A = A^T$ and if $...
- 696
1
vote
1
answer
452
views
About the Hadamard conjecture
On the wikipedia article about Hadamard Matrix it says that "The smallest order that cannot be constructed by a combination of Sylvester's and Paley's methods is $92$"
But it also says that ...
- 696
8
votes
1
answer
286
views
Cardinality of the maximum points of the determinant on matrices with entries in [-1, 1]
By multilinearity, the maximum of the determinant on matrices with entries in the interval [-1, 1] is attained at a {-1, 1}-matrix. By the following example, the maximum is attained at infinitely many ...
- 745
16
votes
2
answers
504
views
The number of 0-1 normal matrices
Let $A\in\{0,1\}^{n\times n}$ be a $n\times n $ matrix with entries in the discrete set $\{0,1\}$.
My question: What is the number of matrices in $\{0,1\}^{n\times n}$ that are normal, that is, ...
- 11
2
votes
0
answers
122
views
Number of distinct rows and columns in a matrix with bounded number of entries
How many distinct rows and columns a real square matrix can have (at least in symmetric case) such that rank of matrix is $r$ and entries:
are from $\{-b,-b+1,\dots,0,\dots,b-1,b\}$?
are from $\{-b,-...
- 13.9k
8
votes
1
answer
356
views
Rank of a combinatorial matrix
For any $2n$ with $n\in\mathbb{N}$, we conjecture the matrix $A\in\mathcal{M}_{3n\times 2n}$ to have rank $\lceil{\frac{5n-1}{3}}\rceil$ where $$A=\left(\begin{array}{cccccc}
0 & & & &...
- 109k
1
vote
0
answers
119
views
An analogue of Hermitian matrix - does it exist?
Let $k$ be any field and $R\subseteq M_s(k)$ be a subring of $s\times s$ matrices over $k$. Identify $k$ with the scalar matrices, so that $k\subseteq R$. Let $A\in M_n(R)$ be an $n\times n$ matrix.
...
- 3,041
2
votes
1
answer
303
views
Submatrix with small sum of elements
Let $A$ be an $n \times n$ matrix, for which I know the size of the sum of all its entries. Now I want to select an $m \times m$-submatrix, whose sum of entries is as small as possible. Is there any ...
CommunityBot
- 1