Counting magic squares of primes and removing elements in latin squares
- đ¤ Speaker: Carlos Vinuesa (Cambridge)
- đ Date & Time: Friday 04 November 2011, 16:00 - 17:00
- đ Venue: MR15, CMS
Abstract
We will discuss some work in progress on giving the asymptotic number of magic squares with primes in [0,N] as entries (using for that the result of Ben Green and Terence Tao on linear equations in primes) and on a problem on unique completion of latin squares in which we start with a certain type of latin square and remove each element with a fixed probability.
Series This talk is part of the Discrete Analysis Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Discrete Analysis Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR15, CMS
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Carlos Vinuesa (Cambridge)
Friday 04 November 2011, 16:00-17:00