A classic problem in graph theory is to find the chromatic number of a given graph: that is, to find the smallest number of colors needed to assign every vertex a color such that whenever two vertices are adjacent, they receive different colors.  This problem has been studied for many families of graphs, including cube-like […]

Title: Cellular resolutions of the diagonal and exceptional collections for toric Deligne-Mumford stacks (Continued) Abstract: Beilinson gave a resolution of the diagonal for complex projective space which yields a strong, full exceptional collection of line bundles. Bayer-Popescu-Sturmfels generalized Beilinson's result to a cellular resolution of the diagonal for what they called "unimodular" toric varieties (a more […]

Title: Building the Fan of a Toric Variety Speaker: Reginald Anderson, Department of Mathematical Sciences, Claremont McKenna College Abstract: Roughly speaking, algebraic geometry studies the zero sets of polynomials, which lead to objects called varieties. Since the zero sets of polynomials do not always pass the vertical line test, we enlist other methods to study […]