Ward's divisibility conjecture for Griesmer codes
Ward's divisibility conjecture for Griesmer codes
Let be a Griesmer code, where .
Ward's divisibility conjecture. Suppose that and . Then is a divisor of .
This conjecture seeks to extend Ward's divisibility results for Griesmer codes over nonprime fields. It is motivated by the fact that divisibility over prime fields is stronger, while examples such as the hexacode show that -divisibility need not hold when with ; its resolution is not specified here.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Haihua Deng, Hexiang Huang and Qing Xiang, “Divisibility of Griesmer Codes”, arXiv:2506.07846 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.