LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Effective Computations for Weakly Special Loci
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Effective Computations for Weakly Special Loci

65 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
IAS

Christopher Daw of the Institute for Advanced Study presents a research seminar talk on effective computations for variations of integral Hodge structures. He traces a line of results beginning with a conjecture he made with Ren and Javanpeykar-Kuhne, in the Shimura setting, that a variation has only finitely many non-factor special subvarieties of degree at most d. He covers how Urbanik proved this and produced an explicit algorithm, and how Klingler-Otwinowska-Urbanik showed these subvarieties are defined over the algebraic numbers when the variation itself is. Daw then presents work in progress with Binyamini and Lerer establishing an effectively computable polynomial bound on the complexity, meaning degree, coefficient height, and field of definition, of these subvarieties, and uses it to derive a polynomial separation bound in the period domain that nearly resolves a conjecture of Lairez-Sertoz. The talk assumes graduate-level familiarity with Hodge theory and Shimura varieties and is delivered on a blackboard in the IAS Special Year Research Seminar series.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 5 m
Compared with MathematicsShorter than 71%
Source channelInstitute for Advanced Study (YouTube)