A proof of Pyber's base size conjecture

From MaRDI portal




Abstract: Building on earlier papers of several authors, we establish that there exists a universal constant c>0 such that the minimal base size b(G) of a primitive permutation group G of degree n satisfies log|G|/lognleqb(G)<45(log|G|/logn)+c. This finishes the proof of Pyber's base size conjecture. An ingredient of the proof is that for the distinguishing number d(G) (in the sense of Albertson and Collins) of a transitive permutation group G of degree n>1 we have the estimates sqrt[n]|G|<d(G)leq48sqrt[n]|G|.



Cites work







This page was built for publication: A proof of Pyber's base size conjecture

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