| Publication | Date of Publication | Type |
|---|
Central limit theorems and the geometry of polynomials
Journal of the European Mathematical Society (JEMS) | 2026-03-24 | Paper |
The singularity probability of a random symmetric matrix is exponentially small
Journal of the American Mathematical Society | 2024-10-30 | Paper |
The structure and number of Erdős covering systems
Journal of the European Mathematical Society (JEMS) | 2024-03-11 | Paper |
The least singular value of a random symmetric matrix
Forum of Mathematics, Pi | 2024-02-07 | Paper |
| A new lower bound for sphere packing | 2023-12-15 | Paper |
| The sparse circular law, revisited | 2023-10-26 | Paper |
| The limiting spectral law for sparse iid matrices | 2023-10-26 | Paper |
| An exponential improvement for diagonal Ramsey | 2023-03-16 | Paper |
Erd\H{o}s covering systems
(available as arXiv preprint) | 2022-11-02 | Paper |
Singularity of random symmetric matrices revisited
Proceedings of the American Mathematical Society | 2022-06-15 | Paper |
Singularity of random symmetric matrices revisited
Proceedings of the American Mathematical Society | 2022-06-15 | Paper |
On the Erdős covering problem: the density of the uncovered set
Inventiones Mathematicae | 2022-03-22 | Paper |
Cosine polynomials with few zeros
Bulletin of the London Mathematical Society | 2021-08-13 | Paper |
The Erdős-Selfridge problem with square-free moduli
Algebra & Number Theory | 2021-05-27 | Paper |
| The singularity probability of a random symmetric matrix is exponentially small | 2021-05-24 | Paper |
| Anti-concentration of random variables from zero-free regions | 2021-02-15 | Paper |
Erdős covering systems
Acta Mathematica Hungarica | 2021-01-25 | Paper |
A characterization of polynomials whose high powers have non-negative coefficients
discrete Analysis | 2021-01-16 | Paper |
Flat Littlewood polynomials exist
Annals of Mathematics. Second Series | 2020-12-14 | Paper |
| Random polynomials: the closest roots to the unit circle | 2020-10-21 | Paper |
Covering intervals with arithmetic progressions
Acta Mathematica Hungarica | 2020-10-02 | Paper |
On existentially complete triangle-free graphs
Israel Journal of Mathematics | 2020-05-20 | Paper |
Central limit theorems from the roots of probability generating functions
Advances in Mathematics | 2019-11-14 | Paper |
| Central limit theorems and the geometry of polynomials | 2019-08-23 | Paper |
Partitioning a graph into monochromatic connected subgraphs
Journal of Graph Theory | 2019-08-15 | Paper |
Ramsey graphs induce subgraphs of many different sizes
Combinatorica | 2019-05-23 | Paper |
Dense subgraphs in random graphs
Discrete Applied Mathematics | 2019-05-03 | Paper |
The Erd\H{o}s-Selfridge problem with square-free moduli
(available as arXiv preprint) | 2019-01-31 | Paper |
Counting zeros of cosine polynomials: on a problem of Littlewood
Advances in Mathematics | 2019-01-18 | Paper |
On the Erd\H{o}s Covering Problem: the density of the uncovered set
(available as arXiv preprint) | 2018-11-08 | Paper |
The multiplication table problem for bipartite graphs
Combinatorica | 2018-09-03 | Paper |
A stability theorem for maximal \(K_{r+1}\)-free graphs
Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
Monochromatic solutions to systems of exponential equations
Journal of Combinatorial Theory. Series A | 2018-07-18 | Paper |
Exponential patterns in arithmetic Ramsey theory
Acta Arithmetica | 2018-01-22 | Paper |
On the maximum running time in graph bootstrap percolation
The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
On the maximum running time in graph bootstrap percolation
The Electronic Journal of Combinatorics | 2017-05-18 | Paper |
| Sturmian words and constant additive complexity | 2015-07-09 | Paper |
Permutations destroying arithmetic structure
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
On abelian and additive complexity in infinite words
Integers | 2012-11-23 | Paper |
