清华主页 EN
导航菜单

Arithmetic holonomy bounds and their applications

来源: 01-17

时间:2023-01-17 Tue 20:00-21:30

地点:Zoom: 293 812 9202(PW: BIMSA)

组织者:Hansheng Diao, Yueke Hu, Emmanuel Lecouturier, Cezar Lupu

主讲人:Vesselin Dimitrov Institute for Advanced Study in Princeton

Abstract

On the heels of the proof of the Unbounded Denominators conjecture (previously presented in this seminar by Yunqing Tang), we discuss an upgraded and refined form of our main technical tool in this area, the "arithmetic holonomicity theorem," of which we will detail a proof based on Bost's slopes method. Our treatment will lead us to a new alternative argument for the unbounded denominators theorem on the Fourier expansions of noncongruence modular forms. We will then conclude by explaining how the same arithmetic holonomicity theorem also leads to a proof of the irrationality of all products of two logarithms $\log(1+1/n)\log(1+1/m)$ for arbitrary integer pairs $(n,m)$ with $|1-m/n| < c$, where $c > 0$ is a positive absolute constant. This is a joint work with Frank Calegari and Yunqing Tang.

返回顶部
相关文章
  • Differential Geometry Seminar | Spectral bounds on hyperbolic 3-manifolds

    Abstract:I will discuss some new bounds on the spectra of Laplacian operators on hyperbolic 3-manifolds. One example of such a bound is that the spectral gap of the Laplace-Beltrami operator on a closed orientable hyperbolic 3-manifold must be less than 47.32, or less than 31.57 if the first Betti number is positive. The bounds are derived using two approaches, both of which employ linear prog...

  • New Ramsey multiplicity bounds and search heuristics

    AbstractWe study two related problems concerning the number of monochromatic cliques in two-colorings of the complete graph that go back to questions of Erdős. Most notably, we “significantly” improve the best known upper bounds on the Ramsey multiplicity of K_4 and K_5 and settle the minimum number of independent sets of size four in graphs with clique number at most four. Motivated by the ...