|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Counting magic squares of primes and removing elements in latin squares
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:
Note that ex-directory lists are not shown.
Other listsCMS Colloquia Cambridge University Expeditions Society One Day Meeting - Seventh Annual Symposium of the Cambridge Computational Biology Institute
Other talksGenome diversity and evolution of DNA methylation genome in the human genome. Female labourers in early nineteenth-century rural Flanders. What's in a name? Meet the Champions...Disability Probabilistic Programming; Ways Forward Spherical squirmers - Models for swimming micro-organisms " 50 years of Computing - A Cambridge Perspective"