← All problems

Berger–Charpin conjecture

Let pp be prime, let q=pmq=p^m with m≥1m\ge 1, and let C⊆FqnC\subseteq\mathbb{F}_q^n be a non-degenerate irreducible cyclic code with gcd⁡(n,q)=1\gcd(n,q)=1. Write Aut⁡perm(C)\operatorname{Aut}_{\mathrm{perm}}(C) for its permutation automorphism group, let σ\sigma be the cyclic shift, and let φ\varphi be the Frobenius permutation. The Berger–Charpin conjecture asserts that every such code is standard, meaning that Aut⁡perm(C)=⟨σ,φ⟩\operatorname{Aut}_{\mathrm{perm}}(C)=\langle\sigma,\varphi\rangle, apart from explicitly structured exceptional families of non-standard irreducible cyclic codes.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A 2026 paper reports that exceptions become vanishingly rare in each fixed characteristic, but this does not settle every exceptional length or the full conjecture.

The Berger–Charpin conjecture concerns whether irreducible cyclic codes are standard apart from explicitly structured exceptions. Feng, Hollmann, Li, and Xiang classified the known non-standard families and presented this as strong evidence, rather than a complete proof.

Known results

  • Under gcd⁡(n,q)=1\gcd(n,q)=1, Feng, Hollmann, Li, and Xiang (March 3, 2026) classified all non-standard non-degenerate irreducible cyclic codes into explicit exceptional families and specified constructions.

October 31, 2026 density claim

Feng, Hollmann, Li, and Xiang report that, for every prime pp, the lengths admitting a non-standard irreducible cyclic code over some field of characteristic pp have natural density zero. This is an asymptotic advance, not a classification of individual exceptional lengths, and the retrieved evidence does not independently verify the claim.

Current status (as of November 2026): The full Berger–Charpin conjecture remains open; a density-zero theorem for exceptional lengths has been claimed but is unverified.

Sources

Solutions 0

No solutions have been posted yet.