← All problems

Yip's maximal subfield clique conjecture for generalized Paley graphs

4 years old · documented by

Let d>1d>1 be an integer. Let q≡1(mod2d)q \equiv 1 \pmod {2d} be a power of a prime pp, and let rr be the largest integer such that d∣q−1pr−1d \mid \frac{q-1}{p^r-1}. The subfield Fpr\mathbb{F}_{p^r} is a clique in the generalized Paley graph GP(q,d)=Cay⁡(Fq+;(Fq∗)d)GP(q,d)=\operatorname{Cay}(\mathbb{F}_q^+;(\mathbb{F}_q^*)^d). Yip's maximal subfield clique conjecture. The subfield Fpr\mathbb{F}_{p^r} forms a maximal clique in GP(q,d)GP(q,d). This conjecture asserts that the largest subfield producing a subfield clique cannot be extended to a larger clique. The paper resolves it in a stronger form under a sufficient-size hypothesis, while the unrestricted statement is the conjecture being addressed.

References

2 papers in this index state this conjecture (2021–2022). The statement above is taken from the most recent of them; the others are arXiv:2106.01522.

Source: Chi Hoi Yip, “Maximality of subfields as cliques in Cayley graphs over finite fields”, arXiv:2209.00864 (2022).

Progress summary

Refreshed
Open · progress reported

A new unverified submission claims the conjecture is false, while the established result proves it only under a size condition.

Yip’s conjecture says that the largest subfield that forms a clique in a generalized Paley graph cannot be enlarged. The unrestricted statement remains unresolved in the established literature.

Known results

  • Yip proved cases including cubic Paley graphs of cubic order and quadruple Paley graphs of quartic order.
  • Yip’s 2022 paper proves a stronger implication when the base-field size satisfies q>(n−1)2q>(n-1)^2.
  • The same paper reports exhaustive checks for n≤5n\le 5 in the remaining small range, and for n=6n=6 when q≤17q\le 17.

November 2026 claimed counterexample

A submitted argument claims that for q=58q=5^8 and d=3d=3, the clique F5\mathbb{F}_5 is not maximal, which would refute the unrestricted conjecture. The argument is unverified and has no independent mathematical assessment.

Current status (as of November 2026): The conjecture is proved under q>(n−1)2q>(n-1)^2 and in earlier special cases; the unrestricted claim remains open, with only an unverified counterexample submission currently reported.

Sources

Solutions 1

The prime field is not a maximal clique in GP(5^8,3): a counterexample to Yip's maximal subfield clique conjectureSee full solutionHide full solution

Result and scope. For q=5^8, d=3 (largest admissible r=1), in every field of order 5^8 the prime field F_5 is a clique of GP(5^8,3) but not maximal (x=2θ+4θ^2+θ^3, f(θ)=0, f=X^8+X^7+2X^6+2). Refutes the unrestricted conjecture; ALCO Theorem 1.2 (q>(n-1)^2) untouched.

Complete proof: The prime field is not a maximal clique in GP(5^8,3): a counterexample to Yip's maximal subfield clique conjecture · PDF.

The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.

This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.