报告题目(10.29):马啸 Typical periodic optimization conjecture and more
报告题目:Typical periodic optimization conjecture and more
报告人:马啸(中国科学技术大学)
报告时间:2024年10月29日 09:45-10:30
报告地点:纯水楼301
报告摘要:In this talk, we study the ergodic optimization problem for a class of typical systems, including Axiom A attractors for both discrete and continuous time case, Anosov diffeomorphisms, subshifts of finite type and uniformly expanding maps. In view of the Typical Periodic optimization conjecture proposed by Yuan and Hunt in 1999, we prove that when the space of observables is $\mathcal{C}^{0,\alpha}$ with $\alpha\in(0,1]$ or $\mathcal{C}^{1,0}$, the optimal (minimizing or maximizing) orbits are generically periodic, thus confirm the conjecture. This is a joint work with Wen Huang, Zeng Lian, Leiye Xu, and Yiwei Zhang.
邀请人:杨大伟