Max formula for cyclic covering dimensions of invariant direct sums
Max formula for cyclic covering dimensions of invariant direct sums
Let be a prime power, let be an operator with , and let and be -invariant subspaces satisfying
Write for the corresponding cyclic covering parameter of a -invariant subspace . The max-formula conjecture. One has
The preceding discussion establishes the inequality with the maximum as a lower bound; the conjecture asserts equality for every such invariant direct-sum decomposition. No resolution is given in the source.
Progress summary
The conjecture remains open: one direction and a few special cases are known, but no general proof or counterexample has been reported.
The conjecture asks whether every -invariant direct-sum decomposition satisfies . It was explicitly posed as Conjecture in a February preprint.
Known results
- The general lower bound is established.
- Equality holds when .
- Equality holds when .
- Equality is immediate when one summand has covering parameter zero.
February 2026 preprint
The preprint presents equality as an open conjecture, not a theorem, and reports no counterexample or general proof. The supplied scans found no later public resolution through August .
Current status (as of August 2026): The lower bound and listed special cases are settled, while the max-formula conjecture remains open in general.
Sources
Sources & referencesView supporting material
Primary source
Yangcheng Li, Pingzhi Yuan, Shuang Li and Yuanpeng Zeng, “On cyclically covering subspaces of F^n_q”, arXiv:2602.04558 (2026).
Solutions 1
Sign in to submit a solution.
The conjecture is false, even when its first equality holds. Take and , and identify the -vector space with
Choose of order and of order . Define the -linear automorphism
Then has order . Set and ; these are -invariant and .
For , the codimension-one subspace is -covering because acts transitively on . Conversely, every -covering subspace must contain the nine-dimensional fixed summand : each fixed vector appearing in any -translate already belongs to the original subspace. Its image in the quotient must also be nonzero. Therefore
For , regard as the unique subfield of with four elements. Since and ,
Consequently , so . A one-dimensional subspace has only one nonzero vector, and its five translates contain at most five nonzero vectors, whereas has fifteen. Hence
Now has codimension in . For every , choose residues and such that and . The Chinese remainder theorem supplies satisfying both conditions. Thus , proving that is -covering. Conversely, a codimension-four subspace has at most elements, so its fifteen translates contain at most elements. Therefore
Finally, the known identity gives . Hence
contradicting the proposed formula.