Relevant Thesis-Based Degree Programs
Graduate Student Supervision
Doctoral Student Supervision
Dissertations completed in 2010 or later are listed below. Please note that there is a 6-12 month delay to add the latest dissertations.
Sticky Kakeya sets in four dimensions (2025)
Kakeya sets are compact subsets of ℝⁿ that contain a unit line segment pointing in every direction. The Kakeya conjecture states that such sets must have Hausdorff dimension n. This thesis will be focused on studying the Kakeya conjecture.We shall firstly discuss the background associated to the Kakeya conjecture. In particular we shall give a brief survey of historical approaches to the problem. Then we proceed to prove my main result, which states that sticky Kakeya sets in ℝ⁴ have dimension at least 3.25.The property of stickiness was first discovered by Katz-Łaba-Tao in their 1999 breakthrough paper on the Kakeya problem. Then Wang-Zahl formalized the definition of a sticky Kakeya set, and they eventually went on to prove that the Kakeya conjecture is true for n = 3 in a spectacular sequenceof recent papers. For n = 4, the best current general bound (that is, without stickiness assumption) is due to Katz and Zahl.In particular, Katz-Zahl used the planebrush argument to show that Kakeya sets in ℝ⁴ have Hausdorff dimension at least 3.059. A planebrush is a geometric object that is a higher dimensional analogue of a geometric object called a hairbrush, which was introduced by Wolff. We wish to apply the planebrush argument to sticky Kakeya sets, as these are an important sub-class to study. Moreover, when we restrict our attention to sticky Kakeya sets, we can improve upon the Katz-Zahl bound by combining the plane-brush result with multi-scale structural information coming from stickiness.
View record
The polynomial method over finite rings and fields (2024)
The finite field Kakeya conjecture concerns the size of subsets of ?ⁿ? that contain a line in each direction, and is a discrete analogue of a major open problem in harmonic analysis. In 2008, Dvir found an elegant solution to this conjecture using elementary properties of polynomials. His proof popularized the polynomial method, which has proved to be a powerful strategy to tackle problems in analysis and discrete mathematics.This dissertation concerns two main research problems emerging from these areas. In the first, we consider a variant of the Kakeya problem. Besicovitch-Rado-Kinney (BRK) sets in ℝⁿ contain a sphere of radius ?, for each ? > 0. It is known that such sets have dimension ? from the work of Kolasa and Wolff. We consider a discrete version of this problem. We define BRK-type sets in ?ⁿ?, and establish lower bounds on the size of such sets using techniques introduced by Dvir’s proof of the finite field Kakeya conjecture.For our second main research problem, we study connections between hyperplanes and generalized polynomials in (ℤ/?ᵏℤ)ⁿ. Let ?ⁿ be the linear span of characteristic functions of hyperplanes in (ℤ/?ᵏℤ)ⁿ. We establish new upper bounds on the dimension of ?ⁿ over ℤ/?ℤ, or equivalently, on the rank of point-hyperplane incidence matrices in (ℤ/?ᵏℤ)ⁿ over ℤ/?ℤ. Our proof is based on a variant of the polynomial method using binomial coefficients in ℤ/?ᵏℤ as generalized polynomials. We also establish additional necessary conditions for a function on (ℤ/?ᵏℤ)ⁿ to be an element of ?ⁿ.
View record
The unboundedness of the Maximal Directional Hilbert Transform (2018)
In this dissertation we study the maximal directional Hilbert transform operatorassociated with a set U of directions in the n-dimensional Euclideanspace. This operator shall be denoted by ℋU. We discuss in detail theproof of the (p; p)-weak unboundedness of ℋU in all dimensions n ≥ 2 andall Lebesgue exponents 1 p +∞ if U contains infinitely many directionsin Rn. This unboundedness result for ℋU is an immediate consequence ofa lower estimate for ||ℋU||_Lp(ℝn) → Lp(ℝn) that we prove if the cardinality ofU is finite. In this case, we show that ||ℋU||_Lp(ℝn) → Lp(ℝn) is bounded frombelow by the square root of √log(#U) up to a positive constant depending only on p and n,for any exponent p in the range 1 p +∞ and any n ≥ 2. These resultswere first proved by G. A. Karagulyan () in the case n = p = 2.
View record
Restriction Theorems and Salem Sets (2015)
In the first part of this thesis, I prove the sharpness of the exponent range in the L² Fourier restriction theorem due to Mockenhaupt and Mitsis (with endpoint estimate due to Bak and Seeger) for measures on ℝ. The proof is based on a random Cantor-type construction of Salem sets due to Laba and Pramanik. The key new idea is to embed in the Salem set a small deterministic Cantor set that disrupts the restriction estimate for the natural measure on the Salem set but does not disrupt the measure's Fourier decay. In the second part of this thesis, I prove a lower bound on the Fourier dimension of Ε(ℚ,ψ,θ) = {x ∊ ℝ : ‖qx - θ‖ ≤ ψ(q) for infinitely many q ∊ ℚ}, where ℚ is an infinite subset of ℤ, Ψ : ℤ → (0,∞), and θ ∊ ℝ. This generalizes theorems of Kaufman and Bluhm and yields new explicit examples of Salem sets. I also prove a multi-dimensional analog of this result. I give applications of these results to metrical Diophantine approximation and determine the Hausdorff dimension of Ε(ℚ,ψ,θ) in new cases.
View record
Finite configurations in sparse sets (2014)
We prove a result which adds to the study of continuous analogues of Szemerédi-type problems. Let E ⊆ ℝⁿ be a Lebesgue-null set of Hausdorff dimension α, k, m be integers satisfying a suitable relationship, and {B₁,…, Bk} be n × (m − n) matrices. We prove that if the set of matrices Bi are non-degenerate in a particular sense, α is sufficiently close to n, and if E supports a probability measure satisfying certain dimensionality and Fourier decay conditions, then E contains a k-point configuration of the form {x + B₁y,…,x + Bky}. In particular, geometric configurations such as collinear triples, triangles, and parallelograms are contained in sets satisfying the above conditions.
View record
Structure and Arithmetic in Sets (2011)
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants of the Erdös-Szemerédi sum-product phenomenon. In particular, we prove nontrivial lower bounds on the density in the integers of the sumset of a positive relative density subset of the primes. The proof of this result uses Green and Green-Tao pseudorandomness arguments to reduce the problem to an analogous statement for relatively dense subsets of the multiplicative subgroup of integers modulo a large integer N. The latter statement is resolved with a combinatorial argument which bounds high moments of a representation function. We also show that if two distinct sets A and B of complex numbers have very small productset, then they produce maximally large iterated sumsets. This uses an algebraic concept of the multiplicative dimension of a finite set. As an application of the case A=B, we obtain a quantitative version of a result of Chang on sums and products of distinct complex elements.
View record
Arithmetic Structures in Random Sets (2008)
No abstract available.
Master's Student Supervision
Theses completed in 2010 or later are listed below. Please note that there is a 6-12 month delay to add the latest theses.
Progress in projection theory and other dimensional developments (2025)
We provide exposition into the field of projection theory, which lies at the intersection of incidence geometry and geometric measure theory. We first give the necessary preliminaries in Chapter 2, focusing on incidences between points and lines and the definition of Hausdorff dimension. With this background in tow, in Chapter 3 we dive into thorough surveys on three topics in projection theory: orthogonal projections, Furstenberg sets, and radial projections. We particularly highlight the interconnectedness of these topics in both the discrete and continuum settings. Through these surveys, we also give the necessary background for discussing applications of projection theory in Chapter 4. The first application is on Beck-type problems, first studied in the discrete setting by József Beck in 1983 and in the continuum setting by Orponen, Shmerkin, and Wang in 2022. Given X ⊂ Rⁿ, these problems seek to understand how large the set of lines that contain at least 2 points of X, L(X), can be. To this end, we present a continuum Erdős–Beck theorem due to myself and Marshall in 2024, which motivates and makes use of a dual Furstenberg set estimate due to myself, Fu, and Ren from the same year.The second application is on Falconer-type (distance) problems which have been a prominent topic in both the discrete and continuum settings. Given X ⊂ Rⁿ, these problems seek to understand how large X must be until the set of distinct "distances" between points of X is large (for a reasonable notion of "distance"). To this end, we present a Falconer-type distance problem for dot products due to myself, Marshall, and Senger in 2024, making use of both standard and modern results for orthogonal and radial projections.
View record
A field guide for Hilbert transforms with new estimates on an associated maximal directional operator (2021)
We give an overview of Hilbert transforms, followed by new results concerning maximal directional Hilbert transforms. Historically, the Hilbert transform motivated the development of many tools in harmonic analysis, such as interpolation theorems and more general singular integrals. Over time, variants of the Hilbert transform were studied as prototypical examples of singular integrals and maximal directional operators. In our research, we are especially concerned with maximal directional Hilbert transforms. After rigorously constructing the Hilbert transform and directional Hilbert transforms, we proceed to define the maximal directional Hilbert transforms. We then prove general L² mapping estimates for maximal directional Hilbert transforms, followed by specific examples which sharpen these estimates. Finally, we prove sharp L²(R²) to L²(R²) estimates for a large class of maximal directional Hilbert transforms.
View record
Fractal uncertainty principles for ellipsephic sets (2021)
Fractal uncertainty principles (FUPs) in harmonic analysis quantify the extent to which a function and its Fourier transform can be simultaneously localized near a fractal set. We investigate the formulation of such principles for ellipsephic sets, discrete Cantor-like sets consisting of integers in a given base with digits in a specified alphabet. We employ a combination of theoretical and numerical methods to find and support our results.To wit, we resolve a conjecture of Dyatlov and Jin by constructing a sequence of base-alphabet pairs whose FUP exponents converge to the basic exponent and whose dimensions converge to δ for any given δ ∊ (½, 1), thereby confirming that the improvement over the basic exponent may be arbitrarily small for all δ ∊ (0, 1). Furthermore, using the theory of prolate matrices, we show that the exponents β₁ of the same sequence decay subexponentially in the base.In addition, we explore extensions of our work to higher-order ellipsephic sets using blocking strategies and tensor power approximations. We also discuss the connection between discrete spectral sets and base-alphabet pairs achieving the maximal FUP exponent.
View record
Kakeya maximal function conjecture for semialgebraic mappings (2021)
The Kakeya maximal function conjecture is a quantitative, single scale formulation of the Kakeya conjecture. Recently, algebraic methods have been leading to progress in the Kakeya family of problems. In 2018, Katz and Rogers proved a conjecture concerning the number of ?-tubes with ?-separated directions which intersect a semialgebraic set with proportion at least λ. We will discuss the proof of this result which involves real algebraic geometry. We will then use this result to prove the Kakeya maximal function conjecture for the special case when the mappings are semialgebraic.
View record
Multilinear restriction estimates on fractal sets (2019)
In harmonic analysis there is a rich history of restriction theory for measures supported on smooth manifolds, and recently much focus has turned to restriction for measures supported on fractal sets. On the other hand, the use of multilinear restriction estimates has propelled most current progress on classical restriction theory. In this thesis we discuss the existing literature on both of these main interests in restriction theory, and then consider their combination. We analyze the existence of multilinear restriction estimates for a collection of singular measures, particularly measures supported on Cantor sets. We generalize a linear restriction estimate of Chen to a multilinear setting and provide a class of Cantor sets to which this result applies. Furthermore, we give necessary conditions for the existence of multilinear restriction for singular measures. We are hopeful that the success of multilinear restriction estimates in furthering classical restriction theory may be reproduced in our context.
View record
The finite field restriction problem (2011)
This work studies the extension problem for subsets of finite fields. This remains an important unsolved problem in harmonic analysis, in both the Euclidean and finite field setting. We survey the partial results obtained to date, common techniques, and open conjectures. In the case of a homogeneous variety H over a d-dimensional finite field, the L² to L⁴ boundedness is proved whenever H contains no hyperplanes. This is accomplished by proving an incidence theorem for cones of this type, and applying a sufficient condition for L² to L²m obtained by Mockenhaupt and Tao in their 2004 introductory paper. We moreover present counterexamples for particular cones when Γ4, establishing the 2 to 4 bound as optimal in Γ for general homogeneous varieties.
View record
If this is your researcher profile you can log in to the Faculty & Staff portal to update your details and provide recruitment preferences.
Membership Status
Program Affiliations
Academic Unit(s)