清华主页 EN
导航菜单

Canonical tuples of matrices

来源: 03-17

时间:Fri., 9:00-10:00 am Mar.17, 2023

地点:Zoom Meeting ID: 271 534 5558 Passcode: YMSC

主讲人:​Daniel Litt University of Toronto

Speaker 

Daniel Litt is an Assistant Professor of mathematics at the University of Toronto. He was in a similar position at the University of Georgia from 2019-2022. He completed his PhD at Stanford in 2015; from 2015-2018 he was an NSF Postdoc at Columbia; and from 2018-2019 he was a member at the Institute for Advanced Study. Broadly speaking, he is interested in the interplay between algebraic geometry and number theory (and, to a lesser extent, topology).


Abstract

I'll describe some concrete questions of linear algebra arising from the dynamics of mapping class group actions on character varieties. Variants of these questions go back to work of Painlevé, Fuchs, Gambier, and Schlesinger at the beginning of the 20th century, but their (partial) answers depend on modern techniques from algebraic and arithmetic geometry.

I'll describe how this work resolves (arithmetic) conjectures of Esnault-Kerz, Budur-Wang, Kisin, and Whang, and makes progress towards a (topological) conjecture of Putman-Wieland. Everything is joint with Aaron Landesman.

返回顶部
相关文章
  • High-dimensional canonical correlation analysis

    Speaker:Vadim GorinAssociate Professor of Statistics and Mathematics at University of California, BerkeleyAbstract:Canonical correlations have two faces: from one side, in statistics they give a way to measure dependence between two datasets. From the other side, in linear algebra they represent a canonical form to which a pair of two linear subspaces can be transformed. In the talk we will d...

  • Canonical colourings in random graphs | Research seminar in Discrete Mathematics

    AbstractRdl and Rucinski have extended Ramseys Theorem to random graphs, showing that there is aconstant C' such that with high probability, any two-colouring of the edges of G(n, p) with edgeprobability p= C'n?/(t+1) contains a monochromatic copy of Kt (the complete t-vertex graph). Weinvestigate how this statement extends to arbitrary colourings of G(n,p). Namely, when noassumptions are made ...