11 citations · 17 across the 10 of their papers we have counts for
16 papers
Anti-concentration with respect to random permutations
Aaron Berger, Ross Berkowitz, Pat Devlin +1
Classical anti-concentration results focus on the random sum , where are independent random variables and are real numbers. In this paper, w…
Approximating Min-Diameter: Standard and Bichromatic
Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams
The min-diameter of a directed graph is a measure of the largest distance between nodes. It is equal to the maximum min-distance across all pairs ,…
On sum-intersecting families of positive integers
Aaron Berger, Nitya Mani
We study the following natural arithmetic question regarding intersecting families: how large can a family of subsets of integers from be such that, for every pai…
Non-classical polynomials and the inverse theorem
Aaron Berger, Ashwin Sah, Mehtaab Sawhney +1
In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers -norm. We give a brief deduction of the fact that a bounded fun…
-intersecting families of graphs
Aaron Berger, Yufei Zhao
Ellis, Filmus, and Friedgut proved an old conjecture of Simonovits and Sós showing that the maximum size of a triangle-intersecting family of graphs on vertices has size at mos…
Popular differences for matrix patterns
Aaron Berger, Ashwin Sah, Mehtaab Sawhney +1
The following combinatorial conjecture arises naturally from recent ergodic-theoretic work of Ackelsberg, Bergelson, and Best. Let , be integer matrices, …