University of Birmingham > Talks@bham > Combinatorics and Probability seminar > The Namer-Claimer game

## The Namer-Claimer gameAdd to your list(s) Download to your calendar using vCal - Ben Barber, University of Bristol
- Thursday 29 November 2018, 15:00-16:00
- Watson LTB.
If you have a question about this talk, please contact Johannes Carmesin. Consider the following game played by two players, Namer and Claimer, on the board [n]. In each round, Namer names a forbidden distance d, then Claimer claims a subset of [n] not containing two points at distance d. The game ends once Claimer has claimed all of [n]; Claimer wants this to happen as fast as possible, and Namer wants to delay it. How long is the game with optimal play from each side? The answer reveals a surprising connection with arithmetic Ramsey theory. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsAlgebra Reading Group on Sporadic Groups Beverley Glover Computer Science Departmental Series## Other talks[Friday seminar]: Irradiated brown dwarfs in the desert The percolating cluster is invisible to image recognition with deep learning Signatures of structural criticality and universality in the cellular anatomy of the brain Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems |