Competitive programming for pure mathematics

On April 10, we’ll host a special session by Dániel Varga (Rényi Institute of Mathematics, AI Lab), who works at the intersection of AI and pure mathematics. He will present numerous examples from his own work where a problem in pure mathematics (geometry, graph theory, algebra) can be advanced by translating it into an algorithm to find possible solutions to concrete cases. A competitive programmer is in a perfect position to execute such a translation, which is often just a few tens of lines of code, but running that code can provide important insights about the problem, or even solve it completely.

The speaker will try to provide an opportunity for the most motivated members of the audience to get involved in such work. Although not the main focus of this session, the speaker will talk briefly about other research directions pursued at the Rényi AI Lab.

Coordinates

• Time: 2024 April 10, Wednesday, 14:15 - 17:00
• Place: BME Building I, Room IB134 (Inside the SZIT department on the 1st floor.)