THE SUBSPACE STRUCTURE OF MAXIMUM CLIQUES IN PSEUDO-PALEY GRAPHS FROM UNIONS OF CYCLOTOMIC CLASSES
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
Let be a 2-dimensional subspace in , such that . Then is a clique in for some if and only if , where and is an odd integer.
Context
Candidate 5 of the open problems stated in "THE SUBSPACE STRUCTURE OF MAXIMUM CLIQUES IN PSEUDO-PALEY GRAPHS FROM UNIONS OF CYCLOTOMIC CLASSES", 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: For an odd prime , fix a primitive element . Let
be the -st cyclotomic classes of . For with , is the Cayley graph on with connection set .
Reconstructed Conjecture 5.9: if is a 2-dimensional -subspace with , then is a clique in for some such iff
with for an odd integer .
Result: The conjecture is true.
Let , , and . The key observation is
Indeed, if , then iff , while , and .
Suppose first that is a clique for some . Since , necessarily . By Asgarli–Yip’s equal-contribution theorem for maximum cliques in semi-primitive pseudo-Paley graphs, applied with , , , , we have
But , so contains exactly one further -line. Choose on that line. Then
Write . Put
Then
where is primitive in . Hence is a nonsquare in iff is odd.
It remains to show cannot be square. Let . Since , one has . The projective -lines in are represented by and by , . For ,
Using , two finite lines and lie in the same cyclotomic class iff
Also the line is in the same class as iff . Thus the cyclotomic-class fibers are precisely the orbits of the involution
If were square, this involution would have two fixed points, so the lines of would occupy cyclotomic classes, more than , impossible for a clique in a graph built from only classes. Hence is nonsquare, so is odd.
Conversely, suppose
Then , and is nonsquare. The same involution , , has no fixed points on . Therefore the projective lines of occupy exactly cyclotomic classes. Let be that set of class indices. Then
so every nonzero difference of two elements of lies in the connection set. Hence is a clique in .
This proves both directions.
Citation: Uses Theorem 1.6 of Asgarli–Yip, “The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes,” Finite Fields Appl. 99 (2024), Paper No. 102492. The final classification argument above is elementary and supplies the claimed resolution of Conjecture 5.9.
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 TYPE1
PASS
The proof attacks Conjecture 5.9 exactly and is mathematically sound. The key steps—using Asgarli–Yip Theorem 1.6 to force exactly two -lines in , then classifying the cyclotomic-class fibers via the norm map and the involution —are valid. If is square, too many cyclotomic classes are occupied; if nonsquare, exactly are occupied, giving the converse. I found no prior resolution beyond the cited paper, where this remains stated as a conjecture.
Novelty assessment
TYPE1
Classification rationale: The result appears genuinely new, but it is a narrow resolution of one auxiliary conjecture. Once Asgarli–Yip’s equal-contribution theorem is available, the remaining argument is a short elementary norm/projective-line classification. It would be valuable as an addendum or remark, but likely not enough by itself for a standard standalone combinatorics paper.
Literature check: I found no prior proof of Conjecture 5.9. The latest arXiv version of Asgarli–Yip still states it as open and only reports computational verification for primes . Later related papers by Yip and collaborators on maximum cliques, Peisert/Paley graphs, and unions of cyclotomic classes strengthen nearby results but do not imply this classification. OpenAlex lists no citations to the 2024 Finite Fields and Their Applications paper, and searches for the exact conjecture/notation led back to the original source.
Citation: Shamil Asgarli and Chi Hoi Yip, “The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes,” Finite Fields Appl. 99 (2024), Paper No. 102492; arXiv:2110.07176v5, Conjecture 5.9 and Theorem 1.6.
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.