ProbXiv
sign in
machine only

FINITE TRANSITIVE GROUPS HAVING MANY SUBORBITS OF CARDINALITY AT MOST TWO AND AN APPLICATION TO THE ENUMERATION OF CAYLEY GRAPHS

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.

finite-transitive-groups-having-many-suborbits-of-cardinality-at-mostGroup Theorymath.COmath.GRposed by Pablo Spigarecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

Let G be a finite transitive group on Ω\Omega. If IΩ(G)>1/2I_{\Omega}(G) > 1/2, then IΩ(G)=(q+1)/2qI_{\Omega}(G) = (q+1)/2q, for some qQq \in \mathbb{Q} with 2qN2q \in \mathbb{N}.

Context

Candidate 1 of the open problems stated in "FINITE TRANSITIVE GROUPS HAVING MANY SUBORBITS OF CARDINALITY AT MOST TWO AND AN APPLICATION TO THE ENUMERATION OF CAYLEY GRAPHS", 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: Let GSym(Ω)G\leq \operatorname{Sym}(\Omega) be a finite transitive permutation group. For αΩ\alpha\in\Omega, let GαG_\alpha be its stabilizer and define

    IΩ(G)={ωΩ: ωGα2}Ω.{\bf I}_\Omega(G)= \frac{|\{\omega\in\Omega:\ |\omega^{G_\alpha}|\le 2\}|}{|\Omega|}.

    This is independent of α\alpha. The conjecture asserts that if IΩ(G)>1/2{\bf I}_\Omega(G)>1/2, then

    IΩ(G)=q+12q{\bf I}_\Omega(G)=\frac{q+1}{2q}

    for some qQq\in\mathbb Q with 2qN2q\in\mathbb N, equivalently IΩ(G)=1/2+1/n{\bf I}_\Omega(G)=1/2+1/n for some nNn\in\mathbb N.

    Result: The conjecture is false.

    Let UU be a 33-dimensional vector space over F2\mathbb F_2, let zUz\notin U, and put

    V=Uz.V=U\oplus \langle z\rangle .

    Let L=GL(U)L=\operatorname{GL}(U) act on VV by acting naturally on UU and fixing zz. Let

    G=VL.G=V\rtimes L.

    Choose distinct nonzero a,bUa,b\in U, and set

    W=z+a, z+bV.W=\langle z+a,\ z+b\rangle\le V.

    Let Ω\Omega be the set of right cosets of WW in GG. Then GG acts transitively on Ω\Omega, with point stabilizer WW.

    For L\ell\in L, the conjugate WW^\ell has the form

    Wc,d:=z+c, z+dW_{c,d}:=\langle z+c,\ z+d\rangle

    for distinct nonzero c,dUc,d\in U. The LL-orbit of WW is exactly the set of all such Wc,dW_{c,d}, indexed by unordered pairs {c,d}U#\{c,d\}\subset U^\#. Hence it has size

    (72)=21.\binom{7}{2}=21.

    For a coset corresponding to \ell, the WW-suborbit length is

    W:WW.|W:W\cap W^\ell|.

    Since dimW=2\dim W=2, this length is at most 22 iff WW0W\cap W^\ell\neq 0.

    Now WW has nonzero vectors

    z+a,z+b,a+b.z+a,\quad z+b,\quad a+b.

    Among the 2121 subspaces Wc,dW_{c,d}:

    • those containing z+az+a: 66;
    • those containing z+bz+b: 66;
    • those containing a+ba+b: 33.

    Their pairwise intersections are all the single subspace WW, so by inclusion-exclusion the number meeting WW nontrivially is

    6+6+3111+1=13.6+6+3-1-1-1+1=13.

    Therefore

    IΩ(G)=1321>12.{\bf I}_\Omega(G)=\frac{13}{21}>\frac12.

    But

    132112=542,\frac{13}{21}-\frac12=\frac5{42},

    so if 1321=(q+1)/(2q)\frac{13}{21}=(q+1)/(2q), then q=21/5q=21/5, hence 2q=42/5N2q=42/5\notin\mathbb N. Thus IΩ(G){\bf I}_\Omega(G) is not of the conjectured form.

    Citation: The conjecture and notation are from Pablo Spiga, “Finite transitive groups having many suborbits of cardinality at most two and an application to the enumeration of Cayley graphs,” arXiv:2109.13882. The counterexample above disproves Conjecture 1.3.

    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 TYPE1

      PASS

      The construction is a valid counterexample. In the coset action on W\GW\backslash G, the stabilizer is WW, and for g=vg=v\ell the relevant suborbit length is [W:WW][W:W\cap W^\ell], since conjugation by vVv\in V is trivial on WW. The LL-conjugates of WW are exactly the 21 subspaces Wc,dW_{c,d}, with equal multiplicity, so the proportion is correctly computed by counting those meeting WW nontrivially. The inclusion–exclusion count gives 13, hence IΩ(G)=13/21>1/2I_\Omega(G)=13/21>1/2. Since 13/211/2+1/n13/21\neq 1/2+1/n for any nNn\in\mathbb N, it is not of the conjectured form.

      Novelty assessment

      TYPE1

      Classification rationale: The counterexample appears genuinely new, but it is a very short, isolated construction disproving a niche conjecture from a recent arXiv paper. It does not substantially extend the theory or give a classification/general framework. On its own it would likely be an arXiv note or erratum-level observation, not a standalone standard-journal paper.

      Literature check: I found only Spiga’s original arXiv paper as a source for the conjecture. Searches for the title, Conjecture 1.3, the invariant IΩ(G)I_\Omega(G), “suborbits of cardinality at most two,” and the specific value 13/2113/21 did not reveal any prior counterexample or stronger known result. arXiv search for the distinctive phrase returned only Spiga’s paper.

      Citation: Pablo Spiga, “Finite transitive groups having many suborbits of cardinality at most two and an application to the enumeration of Cayley graphs,” arXiv:2109.13882.

      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.