Combinatorial and Commutative Algebra Seminar 4:00 PM MSCS 514
A characterization of reconstructible MORMORES (Monomial Orders Represented by Matrices with Only Rational Entries) Gabriel Sosa, Colgate University Host: Alessandra Costantini
Abstract: Monomial orders play a crucial role in algorithms for computer algebra systems (in particular elimination and Grobner basis computation). The most commonly used monomial orders: lexicographic, graded lexicorgraphic and graded reverse lexicographic, possess a reconstructibility feature when the number of variables in the polynomial ring is four, or more. Parts of this statement are equivalent to a characterization of compressed ideals by Mermin. In this talk, we will present a characterization of monomial orders with certain properties that posses the reconstructibilty feature, and discuss other questions related to reconstructibility of general monomial orders.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: