Quicklists
Javascript must be enabled

Christopher O'Neill : Mesoprimary Decomposition of Binomial Ideals using Monoid Congruences

root

98 Views

Many algebraic objects are notorious for being easy to define, but hard to find explicitly. However, certain algebraic objects, when viewed with the "correct" combinatorial framework, become much easier to actually find. This allows us to compute much larger examples by hand, and often gives us insight into the object's underlying structure. In this talk, we will define irreducible decompositions of ideals, and explore their underlying combinatorial structure in the special case of monomial ideals in polynomial rings. As time permits, we will look at recent results in the case of binomial ideals. This talk will be accessible to anyone who has taken a course in Abstract Algebra.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video