Óscar Rivero defended his PhD thesis Arithmetic applications of the Euler systems of Beilinson-Flach elements and diagonal cycles, supervised by Víctor Rotger, on 12 February 2021 within the UPC doctoral program in Applied Mathematics. Currently, he is in the group of David Loeffler at the University of Warwick and holding a Newton International Fellowship grant […]
Jordi Vila Pérez defended his PhD thesis Low and high-order hybridised methods for compressible flows (pdf), supervised by Professors Antonio Huerta and Matteo Giacomini, on February 10, 2021, within the UPC doctoral program in Applied Mathematics. Currently, he is a Postdoctoral Associate at the Aerospace Computational Design Laboratory of MIT, where he is working on a project
(IMTech, UPC). Received 9 Jan, 2021 In 2019, Moritz Müller and I resolved a longstanding open question on the computational complexity of proof search. The preliminary version of the article “Automating Resolution is NP-Hard” was the co-winner of the Best Paper Award at the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019).
The European Research Council has announced tentative dates for the 2021 call. IMTech is willing to act as host institution for candidates in mathematics and related areas. Interested candidates are invited to write to Marc Noy (IMTech Director) at marc.noy@upc.edu or to contact a faculty member. The tentative calendar is: Starting Grants: 12/01/2021—9/03/2021 Consolidator Grants: 21/01/2021—20/04/202 Advanced Grants: 20/05/2021—31/08/2021
(NL English translation, with permission from El País, of the article Cómo visitar dos millones de estrellas en el menor tiempo posible published on December 14, 2020, in the “Café y Teoremas” series) The Gaia project of the European Space Agency (ESA) has cataloged 2,079,471 stars. Could we find a route to visit them all,
