Abstract

Let Ck(q)C_k(q) be the least cardinality of a family of nonzero polynomials over Fq\mathbb F_q whose associated codimension-kk partial-circulant kernels cover the full coefficient space. Chow and Rimani'c conjectured that Ck(q)=1+q++qkC_k(q)=1+q+\cdots+q^k. We disprove the unrestricted conjecture by constructing thirteen monic polynomials over F2\mathbb F_2 whose k=3k=3 kernels cover F27\mathbb F_2^7; in particular, C3(2)13<15C_3(2)\le 13<15. For a general covering family of size N=qk+SN=q^k+S and Fq\mathbb F_q-linear rank dd, we prove Sd2/3(log(2q)log(eNqk/S))2/3S\gg d^{2/3}\left(\frac{\log(2q)}{\log(eNq^k/S)}\right)^{2/3}. Consequently, for every fixed k2k\ge 2 and all sufficiently large qq, Ck(q)qk+ckq2/3C_k(q)\ge q^k+c_kq^{2/3}. When k=2k=2, an integer-multiplicity refinement of the second-moment covering argument yields lim infq(C2(q)q2)/qc~2\liminf_{q\to\infty}(C_2(q)-q^2)/q\ge \widetilde c_2, where c~2\widetilde c_2 is an explicit one-variable variational constant with numerical value c~2=0.5829944375\widetilde c_2=0.5829944375\ldots. We also classify triples admitting two independent low-degree polynomial syzygies and prove a conditional packet-free lower bound of size qk+(1/2o(1))qk1q^k+(1/2-o(1))q^{k-1}.

AI-generated audit

Audit summary

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

01StatementsNot audited
02ProofsNot audited
03NoveltyNot audited

No report has been generated for this paper in the local prototype.