Past Events

Abstract

A parking function of length n is a sequence a1, a2, . . . , an of positive integers whose increasing rearrangement b1 ≤ b2 ≤ · · · ≤ bn…

How many edges can you place in a graph on n vertices without creating a triangle? Some trial and error suggests that the best thing to do is to split your vertices into two classes of size n/2 and to connect all pairs in different classes, and indeed this is best possible. Starting from this…

The classical conjectures of Green—Griffiths—Lang—Vojta predict the precise interplay between different notions of hyperbolicity: Brody hyperbolic, arithmetically hyperbolic, Kobayashi hyperbolic, algebraically hyperbolic, and groupless. 

In his thesis, Cherry defined a notion of…

The covering gonality of an irreducible projective variety over the complex numbers is the minimum gonality of a curve through a general point on the variety. This definition has two reasonable generalizations to positive characteristic, the covering gonality and the separable covering gonality…

There is a rich interplay between the fields of knot theory and 3- and 4-manifold topology. In this talk, I will describe a weak notion of equivalence for knots called concordance, and highlight some historical and recent connections between knot concordance and the study of 4-manifolds, with a…