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.
Statement
Let G be a finite transitive group on . If , then , for some with .
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
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: Let be a finite transitive permutation group. For , let be its stabilizer and define
This is independent of . The conjecture asserts that if , then
for some with , equivalently for some .
Result: The conjecture is false.
Let be a -dimensional vector space over , let , and put
Let act on by acting naturally on and fixing . Let
Choose distinct nonzero , and set
Let be the set of right cosets of in . Then acts transitively on , with point stabilizer .
For , the conjugate has the form
for distinct nonzero . The -orbit of is exactly the set of all such , indexed by unordered pairs . Hence it has size
For a coset corresponding to , the -suborbit length is
Since , this length is at most iff .
Now has nonzero vectors
Among the subspaces :
- those containing : ;
- those containing : ;
- those containing : .
Their pairwise intersections are all the single subspace , so by inclusion-exclusion the number meeting nontrivially is
Therefore
But
so if , then , hence . Thus 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 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 construction is a valid counterexample. In the coset action on , the stabilizer is , and for the relevant suborbit length is , since conjugation by is trivial on . The -conjugates of are exactly the 21 subspaces , with equal multiplicity, so the proportion is correctly computed by counting those meeting nontrivially. The inclusion–exclusion count gives 13, hence . Since for any , 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 , “suborbits of cardinality at most two,” and the specific value 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 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.