Video Lectures

Separate tags with a comma.

This talk will report on an REU whose goal was to introduce the notion of persistence into Legendrian contact homology. The LCH of a Legendrian knot is computed as the homology of the knot's Chekanov-Eliashberg DGA and is a well-studied invariant of...

The method of hypergraph containers is a widely-applicable technique in probabilistic combinatorics. The method enables one to gain control over the independent sets of many `interesting' hypergraphs by exploiting the fact that these sets exhibit a...