I am joining the University of Illinois Urbana-Champaign (UIUC) CS as an assistant professor in the fall of 2024.
I have been investigating problems involving coding theory, expanders and high-dimensional expanders, optimization such as the sum-of-squares hierarchy, representation theory of the symmetric group and quantum. Interactions among these areas are very present in my research. I am also particularly intrigued by the many connections between CS theory and mathematics. Glimpses on some of my interests in coding theory and expanders can be found in short talks at IAS here and here.
Dimension Independent Disentanglers from Unentanglement and Applications
(with Pei Wu) - Preprint
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates
(with Shashank Srivastava and Madhur Tulsiani) - FOCS 2023
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
(with Pei Wu) - STOC 2023
Exact Completeness of LP Hierarchies for Linear Codes
(with Leonardo Nagami Coregliano and Chris Jones) - ITCS 2023
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
(with Tushant Mittal, Sourya Roy and Avi Wigderson) - FOCS 2022 (invited to special issue)
[video @IAS] [video @Princeton]
A Complete Linear Programming Hierarchy for Linear Codes
(with Leonardo Nagami Coregliano and Chris Jones) - ITCS 2022
Near-linear Time Decoding of Ta-Shma's Codes via Splittable Regularity
(with Shashank Srivastava and Madhur Tulsiani) - STOC 2021
[video @STOC'21] [slides @STOC'21] [video @JTW'20] [slides @Junior Theorists Workshop'20]
Unique Decoding of Explicit \(\epsilon\)-balanced Codes Near the Gilbert-Varshamov Bound
(with Dylan Quintana, Shashank Srivastava and Madhur Tulsiani) - FOCS 2020 (invited to special issue)
[longer video @FOCS20] [longer slides @FOCS20] [slides general CS audience]
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
(with Mrinalkanti Ghosh, Chris Jones, Aaron Potechin and Goutham Rajendran) - FOCS 2020
Tighter Bounds on the Independence Number of the Birkhoff Graph
(with Leonardo Nagami Coregliano) - European J. of Combinatorics
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders
(with Vedat Levi Alev and Madhur Tulsiani) - FOCS 2019
A Constrained Random Walk Through Coding Theory
(Fernando Granha Jeronimo) - Dissertation
Prior to Simons-Berkeley, I had a wonderful experience as a postdoc in Avi Wigderson's group at the Institute for Advanced Study (IAS). I obtained my PhD from UChicago, where I had Madhur Tulsiani as my advisor. I received a B.Sc. and M.Sc. degrees from Unicamp Brazil (my home country) and also received an engineering degree from Telecom Paris (France) as part of a double degree program.
I was a TA 14 times for various courses during my PhD receiving two (annual) TA prizes from the CS department.