All Questions
4 questions
2
votes
1
answer
140
views
Matrix completion problem with determinant condition?
Given two $\{0,1\}^{n\times n}$ matrices $L$ and $M$ and an integer $m$ is there a polynomial in $n$ algorithm to find a $\{-1,0,+1\}$ matrix $T$ such that $$\mathsf{det}(L+T\odot M)=m$$ where $\odot$ ...
1
vote
0
answers
115
views
On the complexity of writing down matrices
Consider families of $0/1$ matrices in $\Bbb B$ where $1+1=1$:
$\mathcal M_{1,n,c}$ contains $2^n\times 2^n$ matrices that can be written as Hadamard product of $t=O(2^{(\log n)^c})$ matrices $$(J_n-...
19
votes
4
answers
719
views
The rank of a perturbed triangular matrix
$\DeclareMathOperator{\rk}{rk}$
The question below is implicit in this MO post, but I believe it deserves to be asked explicitly, particularly now that I have some more numerical evidence.
Suppose ...
13
votes
0
answers
1k
views
Pointwise (Hadamard) matrix product and the rank
$\DeclareMathOperator{\rk}{rk}$
Suppose that $A$ is a square matrix of order $n$. If, for any polynomials $P$ and $Q$ with $\deg P+\deg Q\le 2$, we have
$$ P(A)\circ Q(A^t) = P(1)Q(1)\, I_n \tag{$\...