Combinatorics with a view towards number theory

datacite.rights	open.access
dc.contributor.advisor	Alon, Noga
dc.contributor.author	Kravitz, Noah
dc.contributor.other	Mathematics Department
dc.date.accessioned	2025-06-27T14:23:21Z
dc.date.accessioned	2026-09-30T11:32:14Z
dc.date.available	2025-06-27T14:23:21Z
dc.date.available	2026-09-30T11:32:14Z
dc.date.created	2025-01-01
dc.date.issued	2025
dc.description.abstract	We study several problems in arithmetic combinatorics, loosely grouped around the themes of "combinatorial number theory" and "higher-order Fourier analysis". The problems related to the former theme are the Lonely Runner Problem (from Diophantine approximation), questions about minimal additive complements, and a conjecture of Graham about rearrangements of subsets of F_p^\times. The problems related to the latter theme concern quantitative bounds for some instances of the Bergelson--Leibman Theorem (about subsets of N^d avoiding polynomial progressions).
dc.format.mimetype	application/pdf
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/dsp017m01bq11x
dc.identifier.uri	https://theses-dissertations.princeton.edu/handle/88435/dsp017m01bq11x
dc.language.iso	en
dc.publisher	Princeton, NJ : Princeton University
dc.subject	additive combinatorics
dc.subject	arithmetic combinatorics
dc.subject	combinatorics
dc.subject	number theory
dc.subject.classification	Mathematics
dc.title	Combinatorics with a view towards number theory
dc.type	Academic dissertations (Ph.D.)
pu.date.classyear	2025
pu.department	Mathematics

Files

Now showing 1 - 1 of 1