Lisa Sauermann

activity

20142026

most citedCombinatorial anti-concentration inequalities, with applications

13 citations · 53 across the 33 of their papers we have counts for

collaborators

Showing 2024Show 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.CO2024

New lower bounds for three-term progression free sets in $F_{p}^{n}$

Christian Elsholtz, Laura Proske, Lisa Sauermann

We prove new lower bounds on the maximum size of sets $A \subseteq F_{p}^{n}$ or $A \subseteq Z_{m}^{n}$ not containing three-term arithmetic progressions (consisting of th…

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

New lower bounds for three-term progression free sets in Fpn​

New lower bounds for three-term progression free sets in $F_{p}^{n}$