清华主页 EN
导航菜单

Thurston's《broken windows only theorem》and 《bounded image theorem》

来源: 12-08

时间:Fri., 16:00-17:00 Dec. 8, 2023

地点:Tecent Meeting ID 908-3255-9891; Lecture Hall C548 Shuangqing Complex Building A 清华大学双清综合楼A座C548报告厅

主讲人:​Ken' ichi Ohshika Gakushuin University

Speaker 

Ken' ichi Ohshika is Professor at Gakushuin University and Professor Emeritus of Osaka University.

He received PhD from University of Tokyo in 1989, and worked at Tokyo Institute of Technology, University of Tokyo, and Osaka University before joining Gakushuin University. His interest includes Kleinian groups, hyperbolic geometry, Teichmüller theory, and 3-manifolds. He is a recipient of the MSJ geometry prize (2012).


Abstract

Both the broken windows only theorem and the bounded image theorem constitute important parts of Thurston’s original proof of the unifomisation theorem for Haken manifolds. According to his plan of proofs in a form of diagram, his proof for the bounded image theorem relies essentially on the broken windows only theorem, in particular its second statement. We show that this second statement has counter examples. Although we can fix it by weakening the result, this weak form cannot be used for the proof of the bounded image theorem.

Nevertheless we can prove that the bounded image theorem itself is valid, making use of recent tools of Kleinian group theorem.

The last part is joint work with Cyril Lecuire (ENS Lyon).

返回顶部
相关文章
  • On a Theorem of Furstenberg

    Abstract A theorem of Furstenberg from 1967 states that if Gamma is a lattice in a semisimple Lie group G, then there exists a measure on Gamma with finite first moment such that the corresponding harmonic measure on the Furstenberg boundary is absolutely continuous. We will discuss generalizations of this theorem in the setting of the Mapping class group and Gromov hyperbolic groups.About the ...

  • Simonovits's theorem in random graphs

    AbstractLet $H$ be a graph with $\chi(H) = r+1$. Simonovits's theorem states that, for every edge-critical graph $H$, the unique largest $H$-free subgraph of $K_n$ is its largest $r$-partite subgraph, provided that $n$ is sufficiently large. We show that the same holds with $K_n$ replaced by $G_{n,p}$ whenever $H$ is also strictly 2-balanced and $p \ge C_H n^{-1/m_2(H)} \log(n)^{1/(e(H)-1)}$ fo...