Text only print
Full screen print
Number Theory Seminar
Seminar information archive ～04/24｜Next seminar｜Future seminars 04/25～
| Date, time & place | Wednesday 17:00 - 18:00 117Room #117 (Graduate School of Math. Sci. Bldg.) |
|---|---|
| Organizer(s) | Naoki Imai, Shane Kelly |
2017/10/11
17:30-18:30 Room #056 (Graduate School of Math. Sci. Bldg.)
Michael Temkin (The Hebrew University of Jerusalem)
Logarithmic resolution of singularities (ENGLISH)
Michael Temkin (The Hebrew University of Jerusalem)
Logarithmic resolution of singularities (ENGLISH)
[ Abstract ]
The famous Hironaka's theorem asserts that any integral algebraic variety X of characteristic zero can be modified to a smooth variety X_res by a sequence of blowings up. Later it was shown that one can make this compatible with smooth morphisms Y --> X in the sense that Y_res --> Y is the pullback of X_res --> X. In a joint project with D. Abramovich and J. Wlodarczyk, we construct a new algorithm which is compatible with all log smooth morphisms (e.g. covers ramified along exceptional divisors). We expect that this algorithm will naturally extend to an algorithm of resolution of morphisms to log smooth ones. In particular, this should lead to functorial semistable reduction theorems. In my talk I will tell about main ideas of the classical algorithm and will then discuss logarithmic and stack-theoretic modifications we had to make in the new algorithm.
The famous Hironaka's theorem asserts that any integral algebraic variety X of characteristic zero can be modified to a smooth variety X_res by a sequence of blowings up. Later it was shown that one can make this compatible with smooth morphisms Y --> X in the sense that Y_res --> Y is the pullback of X_res --> X. In a joint project with D. Abramovich and J. Wlodarczyk, we construct a new algorithm which is compatible with all log smooth morphisms (e.g. covers ramified along exceptional divisors). We expect that this algorithm will naturally extend to an algorithm of resolution of morphisms to log smooth ones. In particular, this should lead to functorial semistable reduction theorems. In my talk I will tell about main ideas of the classical algorithm and will then discuss logarithmic and stack-theoretic modifications we had to make in the new algorithm.
