本文印刷
全画面プリント
代数学コロキウム
過去の記録 ～04/19｜次回の予定｜今後の予定 04/20～
| 開催情報 | 水曜日 17:00～18:00 数理科学研究科棟(駒場) 117号室 |
|---|---|
| 担当者 | 今井 直毅，ケリー シェーン |
2017年10月11日(水)
17:30-18:30 数理科学研究科棟(駒場) 056号室
Michael Temkin 氏 (The Hebrew University of Jerusalem)
Logarithmic resolution of singularities (ENGLISH)
Michael Temkin 氏 (The Hebrew University of Jerusalem)
Logarithmic resolution of singularities (ENGLISH)
[ 講演概要 ]
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.
