2
$\begingroup$

This might be a question that shouldn't be asked here. But I need some help. I want to count the number of $n\times n$ symmetric matrices over the finite field $\mathbb{F}_q$ and rank $r$. I found the following note

http://www.math.clemson.edu/~kevja/REU/2004/SymmetricRankRMatrices.pdf

But I think the formula given here is not correct. For example, it says that the number of symmetric matrices of rank $n$ is given by $$q^{{n \choose 2}}\prod\limits_{j=0}^s\left(1-(\frac{1}{q})^{2j-1}\right)$$

where $s=\lfloor{\frac{n}{2}}\rfloor$. But this is not matching with the simplest case, i.e. when $n=1$. Is there any other reference?

$\endgroup$

1 Answer 1

7
$\begingroup$

The number of symmetric matrices of a given rank over a finite field is computed in Theorem 2 in the following article.

In particular, the number of symmetric $n\times n$ matrices of full rank with entries in $\mathbb{F}_q$ is equal to $$q^{\binom{n+1}{2}}\prod_{1\leq i\leq n\atop i \, odd}\left(1-\frac{1}{q^i}\right).$$

This number agrees with the formula in the the linked REU article modulo a typo.

$\endgroup$
5
  • 4
    $\begingroup$ For some further information and references, see the solution to Exercise 1.198 of Enumerative Combinatorics, vol. 1, second ed. $\endgroup$ Feb 12, 2018 at 17:32
  • $\begingroup$ Thanks. The article of MacWilliams seems interesting. I did not know about it. $\endgroup$
    – Singh
    Feb 13, 2018 at 14:14
  • $\begingroup$ @Singh If this answer is sufficient for you, then you can accept it, so that people reading MathOverflow will know that the question doesn't still need to be answered. $\endgroup$ Aug 24, 2018 at 16:44
  • $\begingroup$ @Zach Teitler Yes, the given answers are sufficient. I apologize as I did not know I had to accept it. $\endgroup$
    – Singh
    Aug 27, 2018 at 8:55
  • $\begingroup$ @Singh I think Zach Teitler is referring to the formal process of accepting answers. $\endgroup$ Aug 28, 2018 at 9:57

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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