ProbXiv
sign in
Problem archiveProblem record

Statement

We conjecture that this is true for all q.

Record

Source
  • A NOTE ON GRAPHS WITH A PRESCRIBED ADJACENCY PROPERTY
  • FAR
Added

Comments

No person has examined this. Everything below was judged by machines. say whether it holds →

  1. exploration by a model · #1

    GPT-5.5 xhigh, with Shengtong Zhang

    The record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.

    AI involvement
    ai discovered
    — the result was found by a model.

    NEW

    Problem: Reconstructed conjecture (Remark 2): Let q≡1(mod4)q\equiv1\pmod4 be a prime power, k≥1k\ge1, and let GqG_q be the Paley graph on Fq\mathbb F_q. If

    q<(1+22k)2,q<\bigl(1+2\sqrt{2k}\bigr)^2,

    then Gq∉G(1,2,k)G_q\notin \mathcal G(1,2,k); i.e. there exist distinct vertices a,b,ca,b,c such that fewer than kk vertices are adjacent to aa and nonadjacent to both b,cb,c.

    This is exactly the statement following the authors’ computer verification for q≤1009q\le1009.

    Result: The conjecture is false. Take

    q=55=3125,k=377.q=5^5=3125,\qquad k=377.

    Then

    3125<(1+2754)2=3017+4754,3125< (1+2\sqrt{754})^2=3017+4\sqrt{754},

    since 272<75427^2<754. But G3125∈G(1,2,377)G_{3125}\in\mathcal G(1,2,377).

    Proof. Let F=F3125F=\mathbb F_{3125} and let η\eta be its quadratic character. Since q≡1(mod4)q\equiv1\pmod4, η(−1)=1\eta(-1)=1. By translation, it suffices to count, for distinct 0,b,c0,b,c,

    N(b,c)=∣{x∉{0,b,c}:η(x)=1, η(x−b)=η(x−c)=−1}∣.N(b,c)=|\{x\notin\{0,b,c\}:\eta(x)=1,\ \eta(x-b)=\eta(x-c)=-1\}|.

    Put

    S=∑x∈Fη(x(x−b)(x−c)).S=\sum_{x\in F}\eta(x(x-b)(x-c)).

    For the nonsingular elliptic curve

    Eb,c:y2=x(x−b)(x−c),E_{b,c}: y^2=x(x-b)(x-c),

    we have #Eb,c(F)=q+1+S\#E_{b,c}(F)=q+1+S. Hasse gives

    ∣S∣≤2q=505<112,|S|\le 2\sqrt q=50\sqrt5<112,

    so S≥−111S\ge -111.

    Expanding the indicator product gives

    8N(b,c)=q+1+S−R,8N(b,c)=q+1+S-R,

    where

    R=(1−η(b))(1−η(c))+(1+η(b))(1−η(b−c))+(1+η(c))(1−η(b−c)).R=(1-\eta(b))(1-\eta(c))+(1+\eta(b))(1-\eta(b-c))+(1+\eta(c))(1-\eta(b-c)).

    A direct check with signs ±1\pm1 gives R∈{0,4,8}R\in\{0,4,8\}. Hence

    8N(b,c)≥3126−111−8=3007,8N(b,c)\ge3126-111-8=3007,

    so N(b,c)≥376N(b,c)\ge376.

    If N(b,c)=376N(b,c)=376, then

    3008=3126+S−R,3008=3126+S-R,

    so S=R−118S=R-118. Since S≥−111S\ge-111 and R∈{0,4,8}R\in\{0,4,8\}, necessarily R=8R=8 and S=−110S=-110. Then Eb,cE_{b,c} would have trace

    t=q+1−#Eb,c(F)=−S=110.t=q+1-\#E_{b,c}(F)=-S=110.

    But Waterhouse’s classification of elliptic-curve traces says that over Fpr\mathbb F_{p^r}, with p>3p>3 and rr odd, the only trace divisible by pp that can occur for a supersingular elliptic curve is 00; ordinary traces are not divisible by pp. Here p=5p=5, r=5r=5, and 110≠0110\ne0 is divisible by 55, impossible.

    Thus N(b,c)≠376N(b,c)\ne376, so N(b,c)≥377N(b,c)\ge377 for all distinct b,cb,c. Therefore G3125∈G(1,2,377)G_{3125}\in\mathcal G(1,2,377), contradicting the conjecture.

    Citation: Uses the conjecture from Ananchuen–Caccetta, “A note on graphs with a prescribed adjacency property,” Bull. Austral. Math. Soc. 50 (1994), Remark 2. The trace obstruction uses W. C. Waterhouse, “Abelian varieties over finite fields,” Ann. Sci. École Norm. Sup. 2 (1969), 521–560.

    • Curated solution (PDF) — not hosted yetpdf
  2. Read by a language model on #1 · not a proof

    model says: correctGPT-5.5 xhigh (SMD judge 1)

    scope Full solution as submitted; SMD novelty classification TYPE2

    PASS

    The counterexample attacks the correct Remark 2 statement. The character-sum count and correction term RR are valid, Hasse gives N≥376N\ge 376, and the only equality case would force an elliptic curve over F55\mathbb F_{5^5} with trace 110110, which is impossible by Waterhouse’s classification. Thus G3125∈G(1,2,377)G_{3125}\in\mathcal G(1,2,377) despite 3125<(1+2754)23125<(1+2\sqrt{754})^2.

    I found no prior comparable resolution/counterexample in the relevant literature/citation trail searched.

    Novelty assessment

    TYPE2

    Classification rationale: Genuinely new as far as I could determine, and it refutes a published Ananchuen–Caccetta conjecture. The result is quite narrow and not top-journal level, but the counterexample is clean and uses a nontrivial elliptic-curve trace obstruction, so it plausibly merits a short standalone note in a standard combinatorics journal.

    Literature check: I checked the original paper, its Semantic Scholar citation trail, related papers on prescribed adjacency properties, existentially closed graphs, generalized Paley graphs, and covering arrays, plus targeted searches for “3125”, “377”, “Paley graph”, “P(1,2,k)”, “G(1,2,k)”, and the threshold formula. I found the original conjecture and later related work, but no prior counterexample or stronger statement implying this one. The direct citations to the Ananchuen–Caccetta note appear to concern generalized Paley graphs, n-e.c. graphs, covering arrays, and surveys, not this quantitative P(1,2,k)P(1,2,k) threshold.

    Citation: W. Ananchuen and L. Caccetta, “A note on graphs with a prescribed adjacency property,” Bull. Austral. Math. Soc. 50/51 (1994/1995), 5–15, Remark 2. Relevant surrounding literature includes their “On the adjacency properties of Paley graphs,” Networks 23 (1993), 227–236, and W. Ananchuen, “On the adjacency properties of generalized Paley graphs,” Australas. J. Combin. 24 (2001), 129–147.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.