Abstract

Let GG be a permutation group on a finite set ΩΩ. A subset B⊆ΩB \subseteq Ω is a base for GG if the pointwise stabilizer of BB in GG is trivial. The base size of GG, denoted b(G)b(G), is the smallest size of a base. A well known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant cc such that b(G)≤clog⁡∣G∣/log⁡nb(G) \le c\log |G| / \log n for any primitive permutation group GG of degree nn. Some special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.