Lisa Sauermann

activity

20172026

most citedEssentially tight bounds for rainbow cycles in proper edge-colourings

3 citations · 7 across the 17 of their papers we have counts for

collaborators

Showing math.NTShow all

2 papers · 1 filter

math.NT2024

Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields

Christian Elsholtz, Zach Hunter, Laura Proske +1

We prove new lower bounds on the maximum size of subsets $A \subseteq {1, \dots, N}$ or $A \subseteq F_{p}^{n}$ not containing three-term arithmetic progressions. In the setting…

math.NT2022

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 $F_{q} [x]$ . In the integer setting, for a given poly…