Let $p$ be a prime and consider the vector space $\mathbb{F}_p^n$, equipped with the standard bilinear form $\langle x, y \rangle = \sum_{i=1}^n x_iy_i$. A subspace $U$ is said to be totally isotropic if $\langle u, v \rangle = 0$ for every two (not necessarily distinct) $u,v \in U$. What can we say about the dimension of a maximal totally isotropic subspace? A very well known upper bound is $\dim U \leq \lfloor \frac{n}{2} \rfloor$ and it follows by $\dim U + \dim U^{\perp} = n$ and $U \subseteq U^{\perp}$.
But how really is this bound attainable for $p>2$? For $p=2$ there is an easy example - take the subspace with basis $(1,1,0,\ldots,0)$, $(0,0,1,1,0,\ldots,0)$, $(0,0,0,0,1,1,0,\ldots,0)$, etc. If you mimic this for other $p$ (by taking chunks of $p$ consecutive $1$-s) the result would be of dimension $\lfloor \frac{n}{p} \rfloor$.
So is the truth closer to $\lfloor \frac{n}{p} \rfloor$ or to $\lfloor \frac{n}{2} \rfloor$? If it is too hard to answer for all $p$, perhaps focusing on $p=3$ only could give good insight. Any help appreciated!
Take a solution to $a^2+b^2+1=0$, there is always one for $k$ a finite field.
For $x\in k^4$, let $P(x)=(x_1,x_2,ax_3+bx_4,-bx_3+ax_4)$.
You'll get that $$\langle P(x),P(y)\rangle = x_1y_1+x_2y_2-x_3y_3-x_4y_4$$ which has an obvious totally isotropic 2-dimensional subspace, namely $x_1=x_3,x_2=x_4$.
Then write $n=4m+d$ and decompose $k^n$ as $m$ copies of $k^4$ and one copy of $k^d$, all mutually orthogonal.
We get a totally $\langle.,.\rangle$-isotropic $2m$-dimensional subspace in the $m$ copies of $k^4$,
If $d=0$ or $d=1$ then this is optimal.
If $d=3$ then there is an additional isotropic vector in the copy of $k^d$, namely the vector $(a,b,1)$, so this is optimal again.
For the remaining case $d=2$, I don't know. For $n=2$ there is a $n/2$ totally isotropic subspace of $k^n$ iff $t^2+1$ has a root in $k$. No idea if it stays true for $n=6$ as well.