Friday, April 3, 2015 - 3:05pm
1 hour (actually 50 minutes)
Primary decomposition is a fundamental operation in commutative algebra. Although there are several algorithms to perform it, this remains a very difficult undertaking in general. In cases with additional combinatorial structure, it may be possible to do primary decomposition "by hand". The goal of this talk is to explain in detail one such example. This is joint work with Zekiye Eser; no prerequisites are assumed beyond knowing the definitions of "polynomial ring" and "ideal".