Base sizes of primitive groups: bounds with explicit constants

From MaRDI portal




Abstract: We show that the minimal base size b(G) of a finite primitive permutation group G of degree n is at most 2(log|G|/logn)+24. This bound is asymptotically best possible since there exists a sequence of primitive permutation groups G of degrees n such that b(G)=lfloor2(log|G|/logn)ceil2 and b(G) is unbounded. As a corollary we show that a primitive permutation group of degree n that does not contain the alternating group mathrmAlt(n) has a base of size at most maxsqrtn,25.



Cites work







This page was built for publication: Base sizes of primitive groups: bounds with explicit constants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755548)