Recently, a program has begun to settle Cameron’s Greedy Conjecture.
Statement
Recently, a program has begun to settle Cameron’s Greedy Conjecture. Thus far, the focus has been primarily on the almost simple primitive groups. The greedy base sizes for primitive G with sporadic socle have been determined in a recent paper [8], showing that for such groups the greedy base size coincides with the base size. Similarly, if G is any primitive group of odd order, then b(G) = G(G) [2]. Conjecture 1 (Cameron’s Greedy Conjecture). There exists an absolute constant c such that if G is any finite primitive permutation group, then G(G) \leq cb(G).
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.