Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
434 views

Smallest matrix covered by many random n by n matrices

We say that a matrix $M$ can be covered by a (smaller) matrix $N$ if every entry in $M$ is contained in some submatrix of $M$ that exactly equals to $N$, up to reordering the rows and columns of $N$. ...
Trinh Huynh's user avatar
1 vote
1 answer
165 views

Combinatorial graph optimization problem on integer adjacency matrices

We are given a $n\times n$ symmetric matrix $M$ whose entries are positive integers. Let $z_{i,j}:=\frac{M_{i,j}}{M_{i,j}+\sum_{k\neq i,j}\min(M_{i,k},M_{k,j})}$ for all $1\le i<j \le n$, and $z:=\...
Penelope Benenati's user avatar