Georgia Institute of Technology College of Sciences

Retinal images are often used to examine the vascular system in a non-invasive way. Studying the behavior of the vasculature on the retina allows for noninvasive diagnosis of several diseases as these vessels and their behavior are representative of the behavior of vessels throughout the human body. For early diagnosis and analysis of diseases, it is important to compare and analyze the complex vasculature in retinal images automatically.

During this talk, we will talk about a geodesic tracking approach that is better able to handle difficult structures, like high curvature and crossings. Additionally, we discuss how one can identify connected components in images that allow for small interruptions within the same component. Both methods takes place in the lifted space of positions and orientations SE(2), which allows us to differentiate between crossings and bifurcations.

We present a novel example of a Lorentzian manifold-with-boundary featuring a dramatic degeneracy in its deterministic and causal properties known as “causal bubbles” along its boundary. These issues arise because the regularity of the Lorentzian metric is below Lipschitz and fit within the larger framework of low regularity Lorentzian geometry. Although manifolds with causal bubbles were recently introduced in 2012 as a mathematical curiosity, our example comes from studying the fundamental equations of fluid mechanics and shock singularities which arise therein. No prior knowledge of Lorentzian geometry or fluid mechanics will be assumed for this talk.

 In 1983, Furstenberg, Katznelson, and Weiss proved that for every finite measurable colouring of the plane, there exists a $d_0$ such that for every $d\geq d_0$ there is a monochromatic pair of points at distance $d$. In contrast to this, we show that there is a finite colouring avoiding arbitrarily large distances. Joint work with Rutger Campbell.

In this paper we propose a general dynamical mechanism that can lead to the failure of the Batchelor's mode-wise power spectrum law in passive scalar turbulence and hyperbolic dynamics, while the cumulative law remains true. Of technical interest, we also employ a novel method of power spectral variance to establish an exponential radial shell law for the Batchelor power spectrum. An accessible explanation of the power spectrum laws via harmonic analysis is also given.

A recent advance by Smith establishes a quantitative converse (conjectured by Smyth and Serre) to Fekete's celebrated theorem for compact subsets of $\mathbb{R}$. Answering a basic question raised by Smith, we formulate and prove a quantitative converse of Fekete for general symmetric compact subsets of $\mathbb{C}$. We highlight and exploit the algorithmic nature of our approach to give concrete applications to abelian varieties over finite fields and to extremal problems in algebraic number theory.

There is a rich history of domino tilings in two dimensions.  Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does a random tiling look like?  These questions and their answers become significantly more difficult in dimension three and above.  Despite this curse of dimensionality, I will discuss recent advances in the theory.  I will also highlight problems that still remain open. 

Is there a natural way to order data in dimension greater than one? The approach based on the notion of data depth, often associated with the name of John Tukey, is among the most popular. Tukey’s depth has found applications in robust statistics, graph theory, and the study of elections and social choice. 

We will give an introduction to the topic, describe the properties of Tukey’s depth, and introduce some remaining open questions as well as our recent progress towards the solutions.

The talk is based on a joint work with Yinan Shen.

 Let A be a subset of the integer lattice of positive upper density. Roth' theorem in this setting states that there are points x,x+y,x+2y in A with the length of the gap y arbitrary large. We show that the lengths of the gaps y contain an infinite arithmetic progression, as long as one measures the length in lp for p>2 even, while this not true for the Euclidean distance.

Such results have been previously obtained in the continuous settings for measurable subsets of Euclidean spaces using methods of time-frequency analysis, as opposed our approach is based on some ideas from additive combinatorics such as uniformity norms and arithmetic regularity lemmas. If time permits, we discuss some other results that can be obtained similarly.

We show that for a fixed $q$, the number of $q$-ary $t$-error correcting codes of length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ for all $t \leq (1 - q^{-1})n - 2\sqrt{n \log n}$, where $H_q(n, t) = q^n / V_q(n,t)$ is the Hamming bound and $V_q(n,t)$ is the cardinality of the radius $t$ Hamming ball. This proves a conjecture of Balogh, Treglown, and Wagner and makes progress towards a 2005 question of Sapozhenko.