Deep adaptive sampling for numerical PDEs

Recent advance on Nesterov acceleration

Abstract Nesterov's accelerated gradient descent (NAG) is one of the milestones in the history of first-order algorithms. Until recently, it was not successfully uncovered by the high-resolution

全职加入清华的他，将为中国数学科学发展带来什么？| 专访著名数学家丘成桐

专访丘成桐，著名数学家国际顶尖数学奖“菲尔兹奖”首位华人得主清华大学讲席教授丘成桐数学科学中心主任求真书院院长，著名数学家，27岁便证明了困扰数学界多年的卡拉比猜想，曾经被《纽约时报》称作“当之无愧...

Trace optimization and eigenvector-dependent nonlinear eigenvalue problems in data science

Abstract Some recent applications of multivariate statistical analysis in data science need to optimize certain trace-related objective functions over the orthogonal constraints. In this talk, we

Geometry of quantum state spaces

Abstract Geometry of classical mechanics usually means symplectic geometry. In quantum mechanics this geometry is inseparably joined to the geometry of probability theory, creating a very rich

Milnor-Witt Bockstein spectral sequence of moduli of stable curves with marked points

Abstract We show that the MW - Bockstein spectral sequence degenerates for genus 0 case over $\mathbb{R}$ or algebraically closed fields and for genus 1 with few marked points over any field. This

Shrinking Target Problem for Matrix Transformations of Tori

Abstract The shrinking target problem concerns the sizes of the sets of the points in a metric space whose orbits under a transformation fall into a family of shrinking subsets infinitely often. We

郑志伟

研究领域 代数几何 教育背景 2010-2014 学士 清华大学 2014-2019 博士 清华大学 科研经历 2022.9-至今 助理教授 清华大学丘成桐数学科学中心 2021.9-2022.9 助理研究员 北京雁栖湖应用数学研究院 2019.10-2021.7 ...

Rigidity in contact topology

Abstract Legendrian links play a central role in low dimensional contact topology. A rigid theory uses invariants constructed via algebraic tools to distinguish Legendrian links. The most influenti...

Generalized Paley Graphs, Finite Field Hypergeometric Functions and Modular Forms

Abstract In 1955, Greenwood and Gleason proved that the two-color diagonal Ramsey number R(4,4) equals 18. Key to their proof was constructing a self-complementary graph of order 17 which does n