J. Sahasrabudhe

activity

20112026

most citedCentral limit theorems and the geometry of polynomials

16 citations · 33 across the 22 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CA2016

Counting Zeros of Cosine Polynomials: On a Problem of Littlewood

Julian Sahasrabudhe

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(θ) = \sum_{a \in A} \cos(aθ), \] in $[0, 2 π]$ , is at least $(\log \log \…

math.CO2016

Ramsey graphs induce subgraphs of many different sizes

Bhargav Narayanan, Julian Sahasrabudhe, István Tomon

A graph on $n$ vertices is said to be \emph{ $C$ -Ramsey} if every clique or independent set of the graph has size at most $C lo g n$ . The only known constructions of Ramsey graphs a…

math.CO2016

A Stability Theorem for Maximal $K_{r + 1}$ -free Graphs

Kamil Popielarz, Julian Sahasrabudhe, Richard Snyder

For $r \geq 2$ , we show that every maximal $K_{r + 1}$ -free graph $G$ on $n$ vertices with $(1 - \frac{1}{r}) \frac{n ^{2}}{2} - o (n^{\frac{r + 1}{r}})$ edges contains a complete $r$ -partite s…

math.CO2016

Monochromatic Solutions to Systems of Exponential Equations

Julian Sahasrabudhe

Let $n \in N$ , $R$ be a binary relation on $[n]$ , and $C_{1} (i, j), \dots, C_{n} (i, j) \in Z$ , for $i, j \in [n]$ . We define the exponential system of equations $\mathcal{…

math.CO2016

Exponential Patterns in Arithmetic Ramsey Theory

Julian Sahasrabudhe

We show that for every finite colouring of the natural numbers there exists $a, b > 1$ such that the triple ${a, b, a^{b}}$ is monochromatic. We go on to show the partition regularity…

Counting Zeros of Cosine Polynomials: On a Problem of Littlewood

Ramsey graphs induce subgraphs of many different sizes

A Stability Theorem for Maximal Kr+1​-free Graphs

Monochromatic Solutions to Systems of Exponential Equations

Exponential Patterns in Arithmetic Ramsey Theory

A Stability Theorem for Maximal $K_{r + 1}$ -free Graphs