Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
118 views

Configurations of signs in a matrix under certain conditions

I have a combinatorial question which is out of my research area. Given a $2^k\times 2^k$ matrix $A=[a_{i,j}]$ with entries in $\lbrace0,\pm1\rbrace$, where $k$ is a positive integer. Is it possible ...
Masayoshi Kaneda's user avatar
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,-...
Turbo's user avatar
  • 13.9k
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-...
Turbo's user avatar
  • 13.9k
4 votes
0 answers
96 views

Are extremal tournament matrices always circulant or 'almost circulant'?

Define an antisymmetric 1-x-matrix as an $n\times n$ matrix $M=(m_{ij})$ with $m_{ii}=0$ and $\{m_{ij},m_{ji}\}=\{1,x\}$ for all $1\le i<j\le n$. Call their set $\mathcal A_n$. The setup is as ...
Wolfgang's user avatar
  • 13.4k
3 votes
0 answers
184 views

Matrices with only two different entries and maximal determinant

Define $\mathcal M_n$ as the set of all $n\times n$ matrices of full rank with each entry either 1 or $x$. I am interested in how big the determinant of such a matrix can be. For this, we define in a ...
Wolfgang's user avatar
  • 13.4k
1 vote
2 answers
477 views

Worst case difference in rank by column-row swapping

Given a matrix $m\in\{-1,+1\}^{n\times n}$. Consider $m^\sigma$ to be collection of all matrices obtained from $m$ by permuting rows and columns. Consider $\mathscr{M}[m^\sigma]$ to be collection of ...
Turbo's user avatar
  • 13.9k
3 votes
1 answer
445 views

Largest symmetric matrix given rank

Let $\mathscr{M}[n,d]$ be collection of $n\times n$ symmetric matrices with real entries from $\{0,1\}$ such that every row/column is distinct with sum of every row/column being $d$. What is minimum ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
138 views

Minimum rank of certain matrices

Let $\mathscr{M}[n]$ be collection of $n\times n$ matrices with real entries from $\{0,1\}$ such that every row is distinct and every column is distinct. What is minimum real rank of matrices in $\...
Turbo's user avatar
  • 13.9k
3 votes
2 answers
279 views

Rank changes with matrix edits

Assume we have rank $r$ real matrix $M\in\{0,1\}^{n\times n}$ (not constrained to symmetric). Assume $W\in\{0,1\}^{n\times n}$ is rank $1$ real matrix. Case $1$: $M+W\in\{0,1\}^{n\times n}$. Could ...
Turbo's user avatar
  • 13.9k