5 papers
Unimodality for Radon partitions of random vectors
Swee Hong Chan, Gil Kalai, Bhargav Narayanan +2
Consider the (almost surely) unique Radon partition of a set of random Gaussian vectors in ; choose one of the two parts of this partition uniformly at random,…
Elementary symmetric polynomials under the fixed point measure
Ayush Khaitan, Ishan Mata, Bhargav Narayanan
We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collectio…
The Reverse Littlewood--Offord problem of Erdős
Xiaoyu He, Tomas Juskevicius, Bhargav Narayanan +1
Let be a sequence of independent Rademacher random variables. We prove that there is a constant such that for any unit vectors $v_1,\ldots,v_n\in \mathbb…
Clique Supersaturation
Quentin Dubroff, Benjamin Gunby, Bhargav Narayanan +1
We study how many copies of a graph that another graph with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge…
Colouring random subgraphs
Boris Bukh, Michael Krivelevich, Bhargav Narayanan
We study several basic problems about colouring the -random subgraph of an arbitrary graph , focusing primarily on the chromatic number and colouring number of . I…