(FWO-KU Leuven) Received 21 April, 2022. The paper [3] solves a long-standing conjecture about the structure of the roots of the Bernstein-Sato polynomial for plane branches posed by T. Yano in 1982 [18]. Let f : (C^{n+1}, 0) −→ (C, 0) be a germ of a holomorphic function. To each such germ, one can associate […]
(UPC, BGSMath), (UPC, IMTech), (ICMAT). Received 21 May, 2021. Introduction In the book The Emperor’s new mind [10], Sir Roger Penrose returns to the artificial intelligence debate to convince us that creativity cannot be presented as the output of a “mind” representable as a Turing machine. This idea, which is platonic in nature and highly
(IMTech–UPC and ICREA). Received 24 Feb, 2021. The paper [1] solves a semilinear version of Hilbert’s XIXth problem that remained open since the 1970s. In dimensions n ≤ 9, it establishes the smoothness of local minimizers of the functional where Ω is an open set of R^{n}, u : Ω ⊂ R^{n} → R, and
(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).
