13 citations · 53 across the 33 of their papers we have counts for
6 papers · 1 filter
An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
Matthew Kwan, Lisa Sauermann
Consider a quadratic polynomial of independent Bernoulli random variables. What can be said about the concentration of on any single value? Th…
On the speed of algebraically defined graph classes
Lisa Sauermann
The speed of a class of graphs counts the number of graphs on the vertex set inside the class as a function of . In this paper, we investigate this f…
Anticoncentration for subgraph counts in random graphs
Jacob Fox, Matthew Kwan, Lisa Sauermann
Fix a graph and some , and let be the number of copies of in a random graph . Random variables of this form have been intensively studied since th…
Combinatorial anti-concentration inequalities, with applications
Jacob Fox, Matthew Kwan, Lisa Sauermann
We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Kr…
On the size of subsets of without distinct elements summing to zero
Lisa Sauermann
Let us fix a prime . The Erdős-Ginzburg-Ziv problem asks for the minimum integer such that any collection of points in the lattice contains points who…
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
Jacob Fox, Lisa Sauermann, Fan Wei
Given a -vertex graph and an integer , what are the -vertex graphs with the maximum number of induced copies of ? This question is closely related to the inducibili…