2
$\begingroup$

It is not difficult to get a formula for the number of $n\times n$-matrices $g\in\mathrm{Mat}_{n}(\mathbb{F}_{q})$ with $\mathrm{rank}(g)=k$. Namely we have got \begin{align*} \mid\{g\in\mathrm{Mat}_{n}(\mathbb{F}\_{q})\mid \mathrm{rank}(g)=k\}\mid = \binom{n}{k}\_{q}\cdot(q^{n}-1)\cdots(q^{n}-q^{k-1}) \end{align*} with $\binom{n}{k}_{q}=\frac{(q^{n}-1)\cdots(q^{n}-q^{k-1})}{(q^{k}-1)\cdots(q^{k}-q^{k-1})}$. My question is now, if it is possible to get a formula in the same fashion for the following number \begin{align*} f(n,q,k):=\mid\{g\in\mathrm{Mat}_{2n}(\mathbb{F}\_{q})\mid g=\begin{pmatrix} A & B \\\ C & -A^{t} \end{pmatrix}, B=B^{t}, C=C^{t} \\text{ and }\mathrm{rank}(g)=k\}\mid \end{align*}. My conjecture (based on computer data for small $n$ and $k$) is the following, but I have no idea for the proof. \begin{align*} f(2n,q,2k)=\binom{2n}{2k}\_{q}\cdot q^{k(k+1)}\displaystyle\prod_{i=1}^{k}(q^{2i-1}-1), \end{align*} \begin{align*} f(2n,q,2k+1)=\binom{2n}{2k+1}\_{q}\cdot q^{k(k-1)}\displaystyle\prod_{i=1}^{k}(q^{2i-1}-1) \end{align*}

$\endgroup$
  • $\begingroup$ If k is odd, I think that will give very strict conditions on A. You might consider asking the question for k=1 or k=3, and perhaps doing a computer enumeration leveraged by whatever thery you can derive. Gerhard "Ask Me About System Design" Paseman, 2012.10.24 $\endgroup$ – Gerhard Paseman Oct 24 '12 at 13:37
  • $\begingroup$ I need the above as a lemma to deduce some deaper results about distribution of special matrices over finite rings. $\endgroup$ – micha Nov 6 '12 at 15:05
  • 1
    $\begingroup$ Try the following: look at the map which takes a matrix of your form to D=[B,A,,A^t,-C]. Ideally the map is bijective and rank preserving. Now if I have not messed up, your problem reduces to counting order 2n matrices which are of rank k and symmetric, for which you may find assistance in the literature. Gerhard "Check All These Suggestions Carefully" Paseman, 2012.11.06 $\endgroup$ – Gerhard Paseman Nov 6 '12 at 16:56
3
$\begingroup$

Just for the (virtual) glory of possible reputation points, here is the comment as an answer.

The columns can be switched to put B and C on the main diagonal, and multiplication of the bottom rows by -1 should produce a symmetric matrix from one of the desired form. This should be a bijective rank preserving operation which takes the current problem to one of counting symmetric matrices of a given rank over the chosen field. I am guessing that this new version is handled in the literature.

Gerhard "Ask Me About System Design" Paseman, 2012.11.07

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.