Julian Sahasrabudhe

From MaRDI portal
Person:528994

Available identifiers

zbMath Open sahasrabudhe.julianMaRDI QIDQ528994

List of research outcomes





PublicationDate of PublicationType
The singularity probability of a random symmetric matrix is exponentially small2024-10-30Paper
The structure and number of Erdős covering systems2024-03-11Paper
The least singular value of a random symmetric matrix2024-02-07Paper
A new lower bound for sphere packing2023-12-15Paper
The sparse circular law, revisited2023-10-26Paper
The limiting spectral law for sparse iid matrices2023-10-26Paper
An exponential improvement for diagonal Ramsey2023-03-16Paper
Erd\H{o}s covering systems2022-11-02Paper
Singularity of random symmetric matrices revisited2022-06-15Paper
On the Erdős covering problem: the density of the uncovered set2022-03-22Paper
Cosine polynomials with few zeros2021-08-13Paper
The Erdős-Selfridge problem with square-free moduli2021-05-27Paper
The singularity probability of a random symmetric matrix is exponentially small2021-05-24Paper
Anti-concentration of random variables from zero-free regions2021-02-15Paper
Erdős covering systems2021-01-25Paper
A characterization of polynomials whose high powers have non-negative coefficients2021-01-16Paper
Flat Littlewood polynomials exist2020-12-14Paper
Random polynomials: the closest roots to the unit circle2020-10-21Paper
Covering intervals with arithmetic progressions2020-10-02Paper
On existentially complete triangle-free graphs2020-05-20Paper
Central limit theorems from the roots of probability generating functions2019-11-14Paper
Central limit theorems and the geometry of polynomials2019-08-23Paper
Partitioning a graph into monochromatic connected subgraphs2019-08-15Paper
Ramsey graphs induce subgraphs of many different sizes2019-05-23Paper
Dense subgraphs in random graphs2019-05-03Paper
The Erd\H{o}s-Selfridge problem with square-free moduli2019-01-31Paper
Counting zeros of cosine polynomials: on a problem of Littlewood2019-01-18Paper
On the Erd\H{o}s Covering Problem: the density of the uncovered set2018-11-08Paper
The multiplication table problem for bipartite graphs2018-09-03Paper
A stability theorem for maximal \(K_{r+1}\)-free graphs2018-07-24Paper
Monochromatic solutions to systems of exponential equations2018-07-18Paper
Exponential patterns in arithmetic Ramsey theory2018-01-22Paper
On the maximum running time in graph bootstrap percolation2017-05-18Paper
https://portal.mardi4nfdi.de/entity/Q52620492015-07-09Paper
Permutations destroying arithmetic structure2015-04-22Paper
On Abelian and Additive Complexity in Infinite Words2012-11-23Paper

Research outcomes over time

This page was built for person: Julian Sahasrabudhe