ProbXiv
sign in
machine only

A study of 2-ended graphs via harmonic functions

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.

a-study-of-2-ended-graphs-via-harmonic-functions-5Number Theorymath.GRmath.NTposed by Agelos Georgakopoulos, Alex Wendlandrecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

Provided lower and upper bounds for f(k).

Context

Candidate 5 of the open problems stated in "A study of 2-ended graphs via harmonic functions", 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 statement: define the Cayley index c(G)c(G) of a vertex-transitive graph GG to be the least nn such that some subgroup of Aut⁡(G)\operatorname{Aut}(G) acts freely on V(G)V(G) with nn orbits. Problem 6.3 asks for bounds on

    f(k)=sup⁡{c(G):G is connected, locally finite, k-regular, 2-ended, vertex-transitive},f(k)=\sup\{c(G):G \text{ is connected, locally finite, }k\text{-regular, 2-ended, vertex-transitive}\},

    assuming this supremum is finite. This reconstruction is supported by the preceding definition of nn-Cayley and the authors’ expectation that every kk-regular 2-ended vertex-transitive graph is f(k)f(k)-Cayley.

    Result: The expected finite function does not exist: already

    f(5)=∞.f(5)=\infty .

    Use the standard Biggs–Conder family of finite connected cubic symmetric graphs XpX_p, for infinitely many primes pp, with

    PSL⁡2(p)≤Aut⁡(Xp)≤PGL⁡2(p).\operatorname{PSL}_2(p)\le \operatorname{Aut}(X_p)\le \operatorname{PGL}_2(p).

    By Tutte’s stabilizer theorem for cubic symmetric graphs, vertex stabilizers have order at most 4848. Hence

    ∣V(Xp)∣≥∣PSL⁡2(p)∣48=p(p2−1)96.|V(X_p)|\ge \frac{|\operatorname{PSL}_2(p)|}{48} =\frac{p(p^2-1)}{96}.

    By Dickson’s classification of subgroups of PGL⁡2(p)\operatorname{PGL}_2(p), every subgroup other than PSL⁡2(p)\operatorname{PSL}_2(p) or PGL⁡2(p)\operatorname{PGL}_2(p) has order at most p(p−1)p(p-1); the two exceptions are too large to act semiregularly on XpX_p. Thus every semiregular subgroup S≤Aut⁡(Xp)S\le \operatorname{Aut}(X_p) satisfies

    ∣S∣≤p(p−1),|S|\le p(p-1),

    so

    c(Xp)≥∣V(Xp)∣p(p−1)≥p+196.c(X_p)\ge \frac{|V(X_p)|}{p(p-1)}\ge \frac{p+1}{96}.

    Now let LL be the two-way infinite path and set

    Yp=Xp□L.Y_p=X_p\square L.

    Then YpY_p is connected, locally finite, 5-regular, 2-ended, and vertex-transitive. Also Aut⁡(Yp)=Aut⁡(Xp)×Aut⁡(L)\operatorname{Aut}(Y_p)=\operatorname{Aut}(X_p)\times \operatorname{Aut}(L) by Cartesian product factorization.

    If a subgroup Γ≤Aut⁡(Yp)\Gamma\le \operatorname{Aut}(Y_p) acts freely with mm orbits, restrict to the level Xp×{0}X_p\times\{0\}. The subgroup of Γ\Gamma preserving this level projects injectively to a semiregular subgroup of Aut⁡(Xp)\operatorname{Aut}(X_p), and distinct projected orbits give distinct Γ\Gamma-orbits. Hence

    m≥c(Xp)≥p+196.m\ge c(X_p)\ge \frac{p+1}{96}.

    As p→∞p\to\infty, the Cayley indices c(Yp)c(Y_p) are unbounded. Therefore no finite universal f(5)f(5) exists, so Problem 6.3’s presupposition is false.

    Citation: Uses the Biggs–Conder construction of highly arc-transitive cubic graphs; Dickson’s subgroup classification for PGL⁡2(p)\operatorname{PGL}_2(p); Tutte’s stabilizer bound for cubic symmetric graphs; and standard Cartesian product automorphism factorization.

    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 TYPE2

      PASS

      The argument attacks the correct statement: it formalizes the authors’ expected f(k)f(k) as the supremum of minimal nn-Cayley indices, and disproves finiteness by showing f(5)=∞f(5)=\infty.

      The construction is mathematically sound given the cited standard facts. The finite cubic symmetric graphs with automorphism group between PSL2(p)\mathrm{PSL}_2(p) and PGL2(p)\mathrm{PGL}_2(p) have semiregular subgroups of size at most p(p−1)p(p-1), while their vertex sets have size ≫p3\gg p^3, giving unbounded Cayley index. Taking Yp=Xp□LY_p=X_p\square L preserves vertex-transitivity and gives connected locally finite 5-regular 2-ended graphs. The level-stabilizer argument correctly transfers the Cayley-index lower bound from XpX_p to YpY_p. Thus no finite universal f(5)f(5) exists. I found no prior stronger resolution of this specific Problem 6.3.

      Novelty assessment

      TYPE2

      Classification rationale: The result gives a genuine negative resolution of Problem 6.3 by showing f(5)=∞f(5)=\infty. It is not a top-journal-level advance: the construction is a short combination of known finite cubic symmetric graphs, Dickson subgroup bounds, Tutte’s stabilizer bound, and a Cartesian product with the double ray. Still, it overturns a stated expectation/problem in a recent paper and is more than a routine exercise; it could plausibly form a short standalone note in a standard graph theory/combinatorics journal.

      Literature check: I found the original problem in Georgakopoulos–Wendland, arXiv:2304.13317. I did not find any later paper, note, forum post, or citation giving this counterexample or a stronger statement such as unbounded nn-Cayley/Cayley index for bounded-degree 2-ended vertex-transitive graphs. Searches around “n-Cayley”, “Cayley index”, “2-ended vertex-transitive”, “Watkins”, “semiregular subgroup”, “multi-Cayley”, and the exact Problem 6.3 phrasing did not reveal a prior resolution. The ingredients are classical, but the specific application to Problem 6.3 appears not to be recorded.

      Citation: Agelos Georgakopoulos and Alex Wendland, “A study of 2-ended graphs via harmonic functions,” arXiv:2304.13317, Problem 6.3. Uses standard results of Biggs–Conder on cubic symmetric graphs, Tutte’s stabilizer bound for cubic symmetric graphs, and Dickson’s subgroup classification for PGL2(p)\mathrm{PGL}_2(p).

      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.