Backend
Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes
arXiv math.IT0 views
arXiv:2611.08203v1 Announce Type: new Abstract: We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of the finite field. This proves the conjecture of Beelen, Datta and Ghorpade and determines the complete weight hierarchy of the corresponding projective Reed-Muller codes. The proof uses Green's hyperplane restriction bound, combined with a footprint argument that reduces the problem to the affine case solved by Heijnen and Pellikaan. Wei duality then determines the hierarchy in sufficiently large degrees, recovering the complete hierarchy in every degree for the projective plane. Finally, we prove an upper bound valid in every degree, and conjecture that it is always sharp.
Source：https://arxiv.org/abs/2611.08203PreviousNOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication SystemsNextLow-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems
Related posts
Agentjacking: A Fake Sentry Error Became a 'Fix' That Claude Code and Cursor Ran
0dev.to
How osFoundry detects that Claude Code is waiting on a permission prompt
0dev.to
A staging task that reached production started with a token in the wrong file
0dev.to
Export the records inside your JSON, then read the CSV back
0dev.to Data
Where can a small AI tool still win?
0dev.to Data
Only two songs charted on 6 platforms this week
0dev.to Data