Back to search

University of Leeds

Distality to and from combinatorics

Abstract

dc:description.abstract

In this thesis, we demonstrate the intimate connection between the model-theoretic notion of distality and concepts from combinatorics: developments in distality both lead to and come from those in combinatorics. Chapter 3 demonstrates the from direction. We prove that expansions of Presburger arithmetic by a predicate R ⊆ ℕ are distal when R satisfies certain arithmetic combinatorial properties. We do so by constructing distal decompositions (or strong honest definitions), a form of cell decomposition with desirable combinatorial properties. Chapter 4 demonstrates the to direction. We prove that relations definable in a distal structure have better bounds for the Zarankiewicz problem, a classical problem in extremal combinatorics. In fact, we prove that these bounds are enjoyed by any relation satisfying an improved version of Szemerédi regularity lemma, a classical theorem in extremal combinatorics. Thus, motivated by distality, we discover an interaction between two areas of extremal combinatorics. Chapter 5 demonstrates both the to and the from directions. We show that the developments of higher-arity distality and higher-arity (hypergraph) regularity lemmas inform one another. The centrepiece of the chapter is a homogeneous hypergraph regularity lemma that we derive for structures satisfying higher-arity distality. In the quest for this, we develop strong honest definitions for higher-arity distality, whose efficacy is supported by the regularity lemma.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Leeds
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tong, Ho Wang Mervyn
Advisors dc:contributor.advisor
  • Eleftheriou, Pantelis
  • Mantova, Vincenzo
ORCID person:identifier.orcid

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Tong, Ho Wang Mervyn. Distality to and from combinatorics. doctoral thesis, University of Leeds, 2025.