For a nonnegative integer r and a positive integer v satisfying 2r(q−1)<v<2(r+1)(q−1), we define the combinatorial numbers Ar(v)=⎩⎨⎧t=r(q−1)−v∑vj=0∑r(−1)j(jr)(r−1t−jq+r−1),1,r>0,r=0. For the projective Reed-Muller code \PRM(q,m,v), we determine its hull dimension: dim\Hull(\PRM(q,m,v))=dim\PRM(q,m,v)−i=0∑ℓA2i+ϵ(v−(ℓ−i)(q−1)), where ℓ=⌊2r⌋,ϵ={0,ris even,1,ris odd. This formula applies in the open lower-half range 0<v<2m\Qm, equivalently for v∈Ir with m≥r+1; the range 2m\Qm<v<m\Qm is then obtained by S\o rensen's duality theorem \cite{Sorensen}.
Cite
@article{arxiv.2604.21808,
title = {Recursive Structure of Hulls of PRM Codes},
author = {Yufeng Song and Qin Yue},
journal= {arXiv preprint arXiv:2604.21808},
year = {2026}
}