Counting magic squares of primes and removing elements in latin squares

Add to your list(s) Download to your calendar using vCal

• Carlos Vinuesa (Cambridge)
• Friday 04 November 2011, 16:00-17:00
• MR15, CMS.

If you have a question about this talk, please contact Ben Green.

Tea in Pavilion E from 3.30

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.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Discrete Analysis Seminar
• Hanchen DaDaDash
• Interested Talks
• MR15, CMS
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.