2026-09-21T13:17:23Zhttps://api.repository.cam.ac.uk/server/oai/request

oai:www.repository.cam.ac.uk:1810/3810502025-04-09T00:43:06Zcom_1810_213747com_1810_256064col_1810_213748

Arithmetic regularity lemmas and applications https://doi.org/10.17863/CAM.116416 Gladkova, Valeriia Wolf, Julia This thesis investigates various aspects of arithmetic regularity lemmas in the context of vector spaces over finite fields of prime characteristic. Chapter 1 obtains a generalisation of the induced arithmetic removal lemma of Bhattacharyya, Fischer, and Lovett [6] for translation-invariant arithmetic patterns, extending it to partition-regular patterns of complexity 1; this also strengthens the result of Fox, Tidor and Zhao [16] for general complexity-1 patterns. Chapter 2 establishes a wowzer-type lower bound on the size of the partition arising from the so-called strong arithmetic regularity lemma, which matches the bound of Conlon and Fox [12] for the analogous result in the graph-theoretic setting. The rest of the thesis concerns higher-order arithmetic regularity, in particular undertaking a study of local higher-order uniformity in Chapter 3. Two approaches to defining local uniformity on polynomial factors are proposed and subsequently applied to generalise two theorems of Green and Sanders [28] to polynomial factors of all degrees; specifically, it is shown that given any bounded function on a vector space over a field of characteristic 2, there is always a polynomial factor on whose zero atom the function is uniform, while over fields of characteristic greater than 2 this cannot be guaranteed. Finally, Chapters 4 and 5 address several questions concerning the quadratic arithmetic regularity lemmas of Terry and Wolf [60] under model-theoretically motivated tameness assumptions, including a proof of their conjecture that the set referred to as the quadratic Green-Sanders example has bounded VC₂-dimension. University of Cambridge 2024-08-31 Thesis Doctoral Doctor of Philosophy (PhD) eng Harding Distinguished Postgraduate Scholars Programme https://www.repository.cam.ac.uk/handle/1810/381050 https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/889867eb-2a97-4171-aa97-25978650b731/download db5b11e84fbae6508ce5d946ee620a9e https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/19e336c7-c441-44b8-8aa9-547330cdb484/download 87eda9de84448d1f82354d60eee3eb5f http://purl.org/NET/rdflicense/allrightsreserved Additive combinatorics Combinatorics Higher-order Fourier Analysis Regularity Lemmas