A logarithmic bound for the irredundant base size of primitive groups

Let GG be a finite primitive group of degree tt. A primitive large-base group is the exceptional family referred to in the preceding results, and let coperatornameI(G)coperatorname{I}(G) denote the irredundant base statistic for GG.

Logarithmic irredundant-base conjecture. There exists a constant C>0C>0 such that, if GG is not a primitive large-base group, then

I(G)<Clogt.\operatorname{I}(G) < C \log t.

This conjecture seeks to extend the paper's height bound to the irredundant-base statistic while eliminating the standard-action exceptions in the preceding theorem. Its resolution is not given in the supplied text.

Sources & referencesView supporting material

Primary source

Nick Gill, Bianca Lodá and Pablo Spiga, “On the height and relational complexity of a finite permutation group”, arXiv:2005.03942 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.