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 listshttp://talks.bham.ac.uk/show/index/1942 Particle Physics Seminars Type the title of a new list here## Other talksPrivileged side-channel attacks for enclave adversaries Hydrodynamics and Chaos in Quantum Matter Fischer Groups Subgroups of the Monster An attack on ECDSA using lattice techniques Physics at van der Waals interfaces: Twists, incommensurability and emergent phenomena |