Random and exact structures in combinatorics

In this thesis I aim to show several developments related to notions of randomness and structure in combinatorics and probability. One central notion, the pseudorandomness-structure dichotomy, has played a key role in additive combinatorics and extremal graph theory. More generally, however, such notions come into play in the study of combinatorial probability and the use of random processes in extremal combinatorics. In a broader view, randomness (and the pseudorandomness notions which resemble it along various axes) can be viewed as a type of structure in and of itself which has certain typical and global properties that may be exploited to exhibit or constrain combinatorial and probabilistic behavior. These broader ideas often come in concert to allow the construction or extraction of exact behavior. I have chosen three directions along which to study this theme: the singularity of discrete random matrices, thresholds for Steiner triple systems, and improved bounds for Szemerédi's theorem. Each concerns breakthroughs in central questions of the fundamental areas of random matrices, combinatorial designs, and additive combinatorics.

Name thesis:degree_name

Doctoral

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Mathematics

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2024

Author dc:creator

• Sah, Ashwin

Advisor dc:contributor.advisor

• Zhao, Yufei

Statement dc:rights

• Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
• Copyright retained by author(s)

Licence dc:rights.uri

• https://creativecommons.org/licenses/by-nc-nd/4.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/155326

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/155326