Number of matrices of a given rank satisfying this condition - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-23T07:54:49Z http://mathoverflow.net/feeds/question/116687 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/116687/number-of-matrices-of-a-given-rank-satisfying-this-condition Number of matrices of a given rank satisfying this condition matrix-analyzer 2012-12-18T08:00:38Z 2012-12-19T07:40:24Z <p>Let $A_1$ and $A_2$ be two arbitrary $n\times n$ matrices with entries in $Z_p$. How many $n\times n$ matrices $B$ are there so that both $A_1-B$ and $A_2-B$ are of rank $n-1$ or less? What is the formula if the rank is $n-k$ (for both $A_1-B$ and $A_2-B$)?</p> <p>It is okay if I know a loose bound (but not trivial, of course). It looks like they are certainly less than $n^2.p^{n^2-k}$. Anything better would be really helpful.</p> <p>Thanks! </p> http://mathoverflow.net/questions/116687/number-of-matrices-of-a-given-rank-satisfying-this-condition/116689#116689 Answer by Ilya Bogdanov for Number of matrices of a given rank satisfying this condition Ilya Bogdanov 2012-12-18T09:44:12Z 2012-12-18T09:50:02Z <p>$\def\rk{\mathop{\rm rank}}\def\ZZ{{\mathbb Z}}$ We need to estimate the number of expansions of the form $A:=A_1-A_2=C_1-C_2$ with $\rk C_i\leq n-k$ (then $B=A_1-C_1=A_2-C_2$). Since the multiplication by a non-degenerate matrix does not change anything, this depends only on $\rk A$. </p> <p>Assume, for instance, that $A$ is non-degenerate. Fix two $(n-k)$-dimensional subspaces $V_1,V_2$ of the space of rows $V=\ZZ_p^n$ with $\dim V_i=n-k$; counting the bases, we obtain that there are there are $$N=\displaystyle \frac{(p^n-1)(p^n-p)\dots (p^n-p^{n-1})} {(p^{n-2k}-1)(p^{n-2k}-p)\dots(p^{n-2k}-p^{n-2k-1})\cdot \bigl((p^{n-k}-p^{n-2k})(p^{n-k}-p^{n-2k+1})\dots(p^{n-k}-p^{n-k-1})\bigr)^2}$$ such pairs of subspaces.</p> <p>Denote by $C_i^j$ the $j$th row of $C_i$. Now let us count all the pairs $(C_1,C_2)$ such that $\mathop{\rm span} (C_i^1,\dots,C_i^n)\subseteq V_i$. Let $V'=V_1\cap V_2$. Then $C_i^j\mod V'$ is determined uniquely, hence we have $p^{n-2k}$ variants for each $C_1^j$, and $C_2$ is reconstructed from $C_1$. Thus we have $p^{n(n-2k)}$ pairs.</p> <p>In total, we get $N\cdot p^{n(n-2k)}$ pairs. In fact, this is an upper bound, since the rank of $C_i$ may be less than $p-k$, and in this case one pair will correspond to several pairs $(V_1,V_2)$.</p> <p>You may easily obtain a bound for $N$, but it would be better to know the relation between $p$ and $n$...</p> <p>If $A$ is degenerate, then this bound should increase, since we just need $V_1+V_2$ to contain the space generated by the rows of $A$. On the other hand, we may restrict ourselves to the case when $(V_1+V_2)\mod V'=\mathop{\rm span}(A^1,\dots,A^n)\mod V'$. </p> http://mathoverflow.net/questions/116687/number-of-matrices-of-a-given-rank-satisfying-this-condition/116763#116763 Answer by matrix-analyzer for Number of matrices of a given rank satisfying this condition matrix-analyzer 2012-12-19T07:40:24Z 2012-12-19T07:40:24Z <p>Thank you Ilya! This was very helpful!</p>