13 citations · 53 across the 33 of their papers we have counts for
5 papers · 1 filter
Sárközy's Theorem in Various Finite Field Settings
Anqi Li, Lisa Sauermann
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings . In the integer setting, for a given poly…
Sharp bounds for rainbow matchings in hypergraphs
Cosmin Pohoata, Lisa Sauermann, Dmitrii Zakharov
Suppose we are given matchings of size in some -uniform hypergraph, and let us think of each matching having a different color. How large does need to be…
Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
Matthew Kwan, Ashwin Sah, Lisa Sauermann +1
An -vertex graph is called -Ramsey if it has no clique or independent set of size (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-sta…
Rota's basis conjecture holds for random bases of vector spaces
Lisa Sauermann
In 1989, Rota conjectured that, given bases of the vector space over some field , one can always decompose the multi-set $B_1\cup \do…
On the probability of a Condorcet winner among a large number of alternatives
Lisa Sauermann
Consider voters, each of which has a preference ranking between given alternatives. An alternative is called a Condorcet winner, if it wins against every other alter…