ProbXiv
sign in
machine only

On cubic Cayley graphs of finite simple groups

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.

on-cubic-cayley-graphs-of-finite-simple-groupsGroup Theorymath.COmath.GRposed by Xin Gui Fang, Cai Heng Li, Jie Wang, Ming Yao Xurecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

However, it is unknown whether all finite groups are connected 3-CI-groups, and it is conjectured in [15] that the answer is positive.

Context

Candidate 1 of the open problems stated in "On cubic Cayley graphs of finite simple groups", extracted for the Scalable Mathematical Discovery run.

People

no project yet · nobody looking

Projects

none yet

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.

begin a project on this problem →

Interest

nobody looking

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

1 attempt

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.

review this attempt

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: Reconstructed conjecture: every finite group GG is a connected 33-CI-group; i.e. every connected Cayley graph Cay(G,S)\mathrm{Cay}(G,S) with S=S1S=S^{-1}, 1S1\notin S, S3|S|\le 3, and S=G\langle S\rangle=G, is a CI-graph: whenever Cay(G,S)Cay(G,T)\mathrm{Cay}(G,S)\cong \mathrm{Cay}(G,T), there is αAut(G)\alpha\in\mathrm{Aut}(G) with Sα=TS^\alpha=T.

    Result: The conjecture is false.

    Let

    G=D8=r,sr4=s2=1, srs=r1G=D_8=\langle r,s\mid r^4=s^2=1,\ srs=r^{-1}\rangle

    be the dihedral group of order 88. Put

    S={r,r1,s},T={s,rs,r2s}.S=\{r,r^{-1},s\},\qquad T=\{s,rs,r^2s\}.

    Both are inverse-closed generating sets of size 33, so the corresponding Cayley graphs are connected cubic Cayley graphs on GG.

    The graph Cay(G,S)\mathrm{Cay}(G,S) is the prism C4K2C_4\square K_2, hence the cube Q3Q_3: the elements 1,r,r2,r31,r,r^2,r^3 form one 44-cycle, the reflections form another, and multiplication by ss gives a perfect matching.

    The graph Cay(G,T)\mathrm{Cay}(G,T) is bipartite with parts r\langle r\rangle and rs\langle r\rangle s. Each rotation is adjacent to exactly three of the four reflections, so it is K4,4K_{4,4} minus a perfect matching, also isomorphic to Q3Q_3. Hence

    Cay(G,S)Cay(G,T).\mathrm{Cay}(G,S)\cong \mathrm{Cay}(G,T).

    However no automorphism of GG maps SS to TT, because automorphisms preserve element orders: SS contains two elements of order 44, namely r,r1r,r^{-1}, while every element of TT is an involution. Thus SS is not a CI-subset.

    Therefore D8D_8 is not a connected 33-CI-group.

    Citation: No external result is needed; the counterexample is elementary.

    Reviews

    0 human reviews · 1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification KNOWN

      PASS

      The counterexample is valid. In D8D_8, both S={r,r1,s}S=\{r,r^{-1},s\} and T={s,rs,r2s}T=\{s,rs,r^2s\} are inverse-closed generating 3-subsets. The Cayley graphs are both isomorphic to Q3Q_3, while no automorphism of D8D_8 can send SS to TT, since SS contains two elements of order 44 and TT consists entirely of involutions. Thus D8D_8 is not a connected 33-CI-group, disproving the stated conjecture.

      Novelty assessment

      KNOWN

      Classification rationale: The proposed counterexample is valid, but it is not a new contribution. The non-CI behavior of the dihedral group of order 88 is already covered by existing small-order CI-group classifications; the cube Q3Q_3 is the standard small witness.

      Literature check: A relevant stronger known result is the complete computational determination of CI-groups of order at most 4747 by Holt and Royle. Since D8D_8 has order 88 and is not a CI-group, this already covers the claimed counterexample; the displayed cubic Cayley-graph witness is an elementary manifestation of that known classification.

      Citation: Derek Holt and Gordon Royle, “A Census of Small Transitive Groups and Vertex-Transitive Graphs,” arXiv:1811.09015, 2018.

      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 endorsements

    No 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

no comments

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.