Past Events

In this overview talk, I will present the encounter-based approach to diffusive processes in Euclidean domains and highlight its fundamental relation to the Steklov spectral problem. So, the Steklov eigenfunctions turn out to be particularly useful...

Let G be a p-adic reductive group and k a field of characteristic p. The category Rep(G) of smooth k-linear representations is at the heart of the mod-p Langlands program. If we let I be a pro-p Iwahori subgroup of G, there is an associated...

Limits and colimit constructions are ubiquitous in category theory, and are one of the main tools used to understand how objects in a category relate to one another. These are very concrete and easily stated in terms of universal properties: given a...

In combinatorial matrix theory (CMT) one studies properties of combinatorial matrices, i.e., matrices with entries 0, 1 and -1. For instance, permutation matrices, i.e., (0,1)-matrices with exactly one 1 in every row and column, are interesting...

Let $f(x)$ be a separable polynomial with rational number coefficients. In this talk I will review how the rational points of the hyperelliptic curve $y^2 = f(x)$ can sometimes be determined using the number field obtained by adjoining a root of $f$...

Characteristic classes are certain cohomology classes that we assign to vector bundles. In this talk, we will first familiarize ourselves with cohomology. We will go over singular cohomology of spaces, the cup product, the cap product, along with...

Strong cocomparability graphs are the reflexive graphs whose adjacency matrix can be rearranged by a simultaneous row and column permutation to avoid the submatrix with rows 01, 10. Strong cocomparability graphs form a subclass of cocomparability...

Lattice Yang-Mills theories are important models in particle physics. They are defined on the d-dimensional lattice ℤd using a group of matrices of dimension N, and Wilson loop expectations are the fundamental observables of these theories. Recently...

The evolution and maintenance of cooperation is a fundamental problem in evolutionary biology. Because cooperative behaviors impose a cost, Cooperators are vulnerable to exploitation by Defectors that do not pay the cost to cooperate but still...

Double dimers are superimposition of two perfect matchings. Such superimpositions can be decomposed into disjoint simple loops. The question we address is: as the graphs become large, in a 'typical' double dimer sample, do some of the loops diverge...