|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 listsThinking Society Medieval Medicine Discussion Group Computing downward Lowenheim-Skolem: Hands on with the real algebraic numbers
Other talksEx-FoxP3 Regulatory T cells uniquely populate the inflamed site in childhood arthritis Mechanisms controlling primary germ layers specification in human European Defence-Industrial Cooperation: Theory and Practice How to keep women (and men) in science "From fragments to target-selective ligands by reaction-driven de novo design" Senate House Tour * 4:00pm - 5:00pm