Abstract:  James Freitag and I introduced “degree of nomminimality” as a way of bounding how many parameters one has to consider to verify the minimality of a finite rank type. At the time we could show that in differentially closed fields (and other similar theories) this degree was bounded by the U-rank of the type plus one. Now, we, together with Remi Jaoui, can show that it is absolutely bounded by two. In fact, if the type is over constant parameters thenthe degree is at most one.

Location:  Hamilton Hall, Room 312