From: Brenda Cook (brenda@math.missouri.edu)
Date: Thu Sep 21 2006 - 13:18:38 CDT
SPECIAL ALGEBRA SEMINAR
University of Missouri-Columbia
Department of Mathematics
Professor Jeremy Martin
University of Kansas
Graph Varieties
Abstract: A graph variety is a space whose points correspond to pictures
of a fixed finite graph G; that is, arrangements of points and lines
that “looklike” G. This is something like a moduli space or a Hilbert
scheme, but actually can be defined and studied using simpler
techniques. The defining equations, component structure, and homology
groups of picture spaces can be described using the combinatorial
structure of G. A particularly central role is played by combinatorial
rigidity theory, the study of infinitesimal motions of a physical
realization of G. If time permits, I’ll also discuss efforts of Mike
Develin, Victor Reiner and myself to extend the theory by replacing the
underlying graph with a more general combinatorial object, a
representable matroid.
Monday, September 25, 2006
4:00-5:00 p.m.
312 Math Sciences
This archive was generated by hypermail 2.1.4 : Sun Oct 01 2006 - 16:00:01 CDT