Previous Conferences & Workshops

A 3-uniform hypergraph is hamiltonian if for some cyclic ordering of its vertex set, every 3 consecutive vertices form an edge. In 1952 Dirac proved that if the minimum degree in an n-vertex graph is at least n/2 then the graph is hamiltonian. We...

Recently, algebraic codes which achieve the optimal trade-off between rate and (list) error-correction radius were constructed by a careful "folding" of the Reed-Solomon code. The "low-degree'' nature of this folding operation was crucial to the...

The divisor matrix is indexed by the natural numbers with (i,j) entry equal to one if i divides j and 0 otherwise. The convolution of a Dirichlet series with the Riemann zeta function corresponds to multiplication of the sequence of coefficients by...

I will report on a work in progress joint with Andrei Okounkov. We extend the methods developed in an earlier work with Mirkovic and Rumynin on modular representations of semi-simple Lie algebras to representation of symplectic reflection algebras...