Pyber's base size conjecture
Add to your list(s)
Download to your calendar using vCal
- Tim Burness (Bristol)
- Wednesday 30 October 2013, 16:30-17:30
- MR12.
If you have a question about this talk, please contact David Stewart.
Let G be a permutation group on a set X. A subset B of X is a base for G if the pointwise stabilizer of B in G is trivial. The base size of G, denoted b(G), is the smallest size of a base for G. A well known conjecture of Pyber from the early 1990s asserts that there is an absolute constant c such that b(G) is at most c.log |G|/log n for any primitive group G of degree n. Several special cases have been verified in recent years, and I will report on recent joint work with Akos Seress that establishes the conjecture for all non-affine groups.
This talk is part of the Algebra and Representation Theory Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|