Today the internet has been getting excited about Sir Michael Atiyah’s claimed proof of the Riemann Hypothesis, which he presented at the Heidelberg Laureate Forum this morning. We’ve collected all the relevant links and tweets to help you make sense of what’s going down in critical-line-town.

# You're reading: Posts Tagged: Heidelberg Laureate Forum

### HLF Blogs: What is the Riemann Hypothesis?

*This week, Katie and Paul are blogging from the Heidelberg Laureate Forum – a week-long maths conference where current young researchers in maths and computer science can meet and hear talks by top-level prize-winning researchers. For more information about the HLF, visit the Heidelberg Laureate Forum website.*

This year at the HLF there are multiple sessions in the program concerning the Riemann Hypothesis, including a talk from one of the laureates, and one of the young-researcher-led workshop sessions. But what exactly is the Riemann Hypothesis, and what is its place in mathematics?

### Michael Atiyah claims proof of Riemann Hypothesis

Is Sir Michael Atiyah giving lecture on Monday Sept. 25 @ #HLF18? Yes.

Will he presenenting a proof of the Riemann Hypothesis? Yes, that is what his abstract says. pic.twitter.com/v1dJhUUUEk— Heidelberg Laureate Forum (@HLForum) September 20, 2018

The internet is buzzing with the news: algebraic topologist and geometer Sir Michael Atiyah has announced that at his talk next Monday at the Heidelberg Laureate Forum, he will deliver a simple new proof of the long-standing Riemann Hypothesis. The news comes as a surprise to many, considering that since the result has been unproven since its conjecture in 1859, if a proof does exist it will likely be far from simple.

### Applications are open for the 6th Heidelberg Laureate Forum

You may have noticed Aperiodical team members Paul and I were blogging from the Heidelberg Laureate Forum back in September. The HLF is an opportunity for young researchers (PhD, MSc and post-doc) to meet the winners of prestigious prizes in maths and computer science, including the Abel Prize, Fields Medal, ACM AM Turing Prize and Nevanlinna prize.

The next HLF will take place in September 2018, and applications open today for Young Researchers who want to participate. If you’re a maths or computer science researcher and want to be invited on a trip to Germany with lots of interesting talks, delicious food and good company, you can apply on the HLF website from today.

### HLF Blogs: Is mathematics idealistic or realistic?

*In September, Katie and Paul spent a week blogging from the Heidelberg Laureate Forum – a week-long maths conference where current young researchers in maths and computer science can meet and hear talks by top-level prize-winning researchers. For more information about the HLF, visit the Heidelberg Laureate Forum website.*

The closing talk of the HLF’s main lecture programme (before the young researchers and laureates head off to participate in scientific interaction with SAP representatives to discuss maths and computer science in industry) was given by Fields Medalist **Steve Smale**.

### HLF Blogs: Efim Zelmanov’s Desert Island Maths

*In September, Katie and Paul spent a week blogging from the Heidelberg Laureate Forum – a week-long maths conference where current young researchers in maths and computer science can meet and hear talks by top-level prize-winning researchers. For more information about the HLF, visit the Heidelberg Laureate Forum website.*

At the start of his HLF lecture on Asymptotic Group Theory on Thursday morning, Fields medalist Efim Zelmanov described the ‘group’ as: “the great unifying concept in mathematics,” remarking “if you go for a trip, and you are allowed to take only two or three mathematical concepts with you, give serious consideration to this one.” Very loosely defined, a group is a set of things (its ‘elements’) that you can ‘multiply’ together, with this multiplication behaving in certain helpful ways. Think of numbers being added, functions composed together or rotations and reflections of a shape being carried out one after the other. I doubt any mathematician would accuse Zelmanov of overstating their importance in mathematics.

In his talk he discussed residually finite groups. These are groups which are infinite in size but still just a little bit finite-y. In technical terms, the group has a set of homomorphisms with finite kernels having trivial intersection. Although the group is too large to see all at once, as Zelmanov put it, we have “photos from all sides of the group”. He contrasted this to “hopelessly infinite groups”, for which no such photo album is possible.

A common way to look at a group is to find a set of ‘generators’: these are elements of the group which you can multiply together to create any element of a group (the elements ‘generate’ the entire group). Some infinite groups can’t be generated from a finite set — consider trying to find a set of rational numbers that you can multiply together to create any rational number. Those that can be generated from a finite set are unexcitingly called ‘finitely generated’. Of course, finite groups are also finitely generated.

Zelmanov considered under what circumstances finitely generated groups can be proved to be finite. One immediate way this won’t happen is if one of the generators is not periodic: if you keep multiplying it by itself you keep getting new elements forever, never ‘looping back’ to the original generator. (Imagine starting with 1 and continually adding 1…) The Burnside problem asks whether there are any other ways to make a finitely-generated, yet infinite, group. In 1991, Zelmanov proved that for residually finite groups, there aren’t. However, this isn’t the case for the ‘hopelessly infinite’ groups.

In his lecture Zelmanov, accompanied by his excellent hand-drawn slides, discussed this before moving on to related topics such as the growth of groups (if you start with a generating set, and create new elements by multiplying them together, how quickly does the set grow?) and ‘approximate groups’ (which, as the name suggests, are things that are like, but not quite, groups).

### Blogs from this year’s Heidelberg Laureate Forum

Paul and I have spent this week blogging from the Heidelberg Laureate Forum, an international event for PhD/postdoc students and top-level maths and computer science researchers.

It was a long week of extravagant dinners, incredible talks and press conferences, (maths) celeb spotting, branded conference freebies, hilarious quotes and exceptional hospitality. Oh, and blogging. Here’s a round-up of what we wrote, in case you’ve missed it this week, as well as some of the other posts the rest of the HLF blog team wrote.