NSF Award
2401117
This project focuses primarily on three different problems in number theory, combinatorics, and ergodic theory. This includes work in additive combinatorics concerning generalizations of Szemerédi's theorem on arithmetic progressions (sequences of numbers that are all equally spaced, like 4, 6, 8, and 10), which, informally, says that any sufficiently large collection of whole numbers contains a long arithmetic progression. It is a central problem in additive combinatorics to determine how large "sufficiently large" is. The investigator will study versions of this question involving more complicated patterns than arithmetic progressions, and then use the results and techniques developed to make progress on a related problem in ergodic theory. The investigator will also study the size and structure of integer distance sets, which are sets of points whose pairwise distances are all whole numbers. This award will support undergraduate summer research on representation theory and additive combinatorics, and also support the training of graduate students.<br/><br/>More specifically, the investigator will build on her previous work on quantitative bounds for subsets of the integers lacking polynomial progressions of distinct degrees and for subsets of vector spaces over finite fields lacking a certain four-point configuration to tackle more general polynomial, multidimensional, and multidimensional polynomial configurations. The results for multidimensional polynomial configurations of distinct degree will then be used to make progress on the Furstenberg--Bergelson--Leibman conjecture in ergodic theory, which concerns the pointwise almost everywhere convergence of certain nonconventional ergodic averages. She will also investigate the size and structure of integer distance sets, in both the Euclidean plane and in higher dimensions, by encoding them as subsets of rational points on certain families of varieties and then studying these varieties. With her undergraduate students, the investigator will study the distribution of entries in the character tables of symmetric groups and some algorithmic problems in higher-order Fourier analysis.<br/><br/>This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
