Other links:

Other links:

Event Calender

Loading Events

Countable Approximation in Mathematics

Speaker: Kyle Austin, Ben-Gurion University of the Negev, Israel

  • This event has passed.

Abstract: Throughout mathematics, separability-type conditions are convenient hypotheses. In my talk, I will address the common practice of approximating complicated objects with “countably generated” ones. I will show how such approximations are useful in topology and coarse geometry and proceed to give a rough outline of how I am using these methods in my research concerning the representation theory of groupoids.

Study at Ashoka

Study at Ashoka