On eigenfunctions and maximal cliques of generalised Paley graphs of square order
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
Statement
Assume that and . Then the cliques from Proposition 4.10 and Proposition 4.13 are maximal.
Context
Candidate 2 of the open problems stated in "On eigenfunctions and maximal cliques of generalised Paley graphs of square order", extracted for the Scalable Mathematical Discovery run.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
NEW
Problem: Reconstructed statement: Let be odd, , , and . Let
Put , let , and let be its subgroup of order . Choose with . Then the conjecture asserts maximality of the Proposition 4.10 and 4.13 cliques:
- if is even, is maximal;
- if is odd, is maximal;
- if is even, is maximal.
This matches Conjecture 4.14 because Proposition 4.10 is the -construction and Proposition 4.13 is the -construction.
Result: The conjecture is true.
Let . For ,
Indeed, if for a primitive , then , while .
Since , modulo we have . Thus , and
because . Hence in . Also .
First suppose and for all . Then for all ,
Since is the set of roots of , the polynomial
is modulo . The coefficients of and give
If , these imply and . Thus . If is even, then , so , contradiction. Therefore, for even , the only possible such is .
Now suppose and for all . Since , we get
Thus
Again using the and coefficients,
If , then and , hence , contradiction. Therefore . But is possible only when , equivalently , i.e. only when is even.
Now maximality follows immediately.
-
If is even and a vertex were adjacent to every vertex of , then the first calculation forces , contradiction. Hence is maximal.
-
If is odd and a vertex were adjacent to every vertex of , write . Then and for all , impossible by the second calculation. Hence is maximal.
-
If is even and were adjacent to every vertex of , write . Then and the second calculation forces , so , contradiction. Hence is maximal.
Thus all cliques from Propositions 4.10 and 4.13 are maximal under the conjectured hypotheses.
Citation: The conjecture and constructions are from Goryainov, Shalaginov, and Yip, “On eigenfunctions and maximal cliques of generalised Paley graphs of square order,” Finite Fields Appl. 87 (2023), Paper No. 102150; arXiv:2203.16081. The proof above is a direct resolution of Conjecture 4.14.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Full solution as submitted; SMD novelty classification TYPE2
PASS
The proof attacks the stated Conjecture 4.14 and is mathematically sound. The key membership criterion is correct, and the polynomial congruence arguments are valid because and . The coefficient comparisons force any common external neighbor to be the already-present vertex , or impossible in the odd case, proving maximality of the Proposition 4.10/4.13 cliques. I see no fatal gap or mismatch.
Novelty assessment
TYPE2
Classification rationale: This appears to be a genuine resolution of a specific conjecture from a recent Finite Fields and Applications paper. The proof is short and elementary, so it is not a major/top-journal advance, but the statement is a nontrivial maximal-clique result in generalized Paley graphs and plausibly publishable as a short note in a standard combinatorics/finite-fields journal.
Literature check: I found closely related later work but not the exact result. Martin–Yip (PAMS 2025; arXiv:2403.04312) proves maximality for the different -construction from the same Goryainov–Shalaginov–Yip paper, under a largeness hypothesis, and explicitly refers to that as confirming a GSY conjecture. Brouwer–Goryainov–Shalaginov–Yip (DCC 2026; arXiv:2503.09914) studies maximal cliques in Paley/Peisert and Desarguesian net settings, including the Paley-square analogue of the -type construction, but does not give the full generalized-Paley Conjecture 4.14 statement. I found no source proving the all-parameter maximality of the Proposition 4.10/4.13 cliques under .
Citation: Goryainov, Shalaginov, Yip, “On eigenfunctions and maximal cliques of generalised Paley graphs of square order,” Finite Fields Appl. 87 (2023), Paper 102150. Related: Martin–Yip, Proc. Amer. Math. Soc. 153 (2025), 109–124; Brouwer–Goryainov–Shalaginov–Yip, Des. Codes Cryptogr. 94 (2026), Paper 101.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.