Previous Conferences & Workshops

Torus-orbit closures in Grassmannians or flag varieties are closely related to matroid theory. I will review some known properties of these torus-orbit closures, with an emphasis on some open problems which are related to Schubert calculus.

In 1999, Pitman and Stanley introduced the polytope bearing their name along with a study of its faces, lattice points, and volume. This polytope is well-studied due to its connections to parking functions, lattice path matroids, generalized...

The plan of the talk is to describe joint work with A. Brown and Z. Wang on the smooth classification of actions of lattices in $\mathrm{SL}(n,\mathbb{R})$ on $n-1$ dimensional manifolds. The method is also amenable to show rigidity for some...

A minimal partition is a decomposition of a manifold into disjoint sets that minimizes a spectral energy functional. In the bipartite case minimal partitions are closely related to eigenfunctions of the Laplacian, but in the non-bipartite case they...

Cayley graphs provide interesting bridges between graph theory, additive combinatorics and group theory. Fixing an ambient finite group, random Cayley graphs are constructed by choosing a generating set at random. These graphs reflect interesting...

I will talk about a proof of local-global compatibility at p for higher coherent cohomology mod p in weight one for Hilbert modular varieties at an unramified prime, assuming we are not in middle degree. I will discuss some key ingredients to the...

In their 1971 study of telephone switching circuitry, Graham and Pollak designed a novel addressing scheme that was better suited for the faster communication required by computers. They introduced the distance matrix of a graph, and used its...

Finding regular subgraphs can be useful. Many results assume a graph is regular or are easier to prove when they are. In 1975, Erdős and Sauer asked for an estimate, for any constant r, on the maximum number of edges an n-vertex graph can have...