NTS ABSTRACTFall2025: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
Oct 16 and 30
 
Line 6: Line 6:
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
{| style="color:black; font-size:100%" table border="2" cellpadding="10" width="700" cellspacing="20"
|-
|-
| bgcolor="#F0A0A0" align="center" style="font-size:125%" |  
| bgcolor="#F0A0A0" align="center" style="font-size:125%" | Robert Lemke Oliver
|-
|-
| bgcolor="#BCD2EE"  align="center" |  
| bgcolor="#BCD2EE"  align="center" | University of Wisconsin-Madison
|-
|-
| bgcolor="#BCD2EE"  |  
| bgcolor="#BCD2EE"  | The Chebotarev density theorem is a powerful tool in number theory, in part because it guarantees the existence of primes whose Frobenius lies in a given conjugacy class in a fixed Galois extension of number fields.  However, for some applications, it is necessary to know not just that such primes exist, but to additionally know something about their size, say in terms of the degree and discriminant of the extension.  In this talk, I'll discuss forthcoming work with Cho and Zaman on the least prime with a specified Frobenius in a fixed Galois extension, with a particular focus on S_n extensions.  Our approach is comparatively elementary, but when combined with existing results based on the zeros of L-functions, it leads to the strongest known bounds in this setting.
|}                                                                         
|}                                                                         
</center>
</center>

Revision as of 15:24, 5 September 2025

Back to the number theory seminar main webpage: Main page

Sep 11

Robert Lemke Oliver
University of Wisconsin-Madison
The Chebotarev density theorem is a powerful tool in number theory, in part because it guarantees the existence of primes whose Frobenius lies in a given conjugacy class in a fixed Galois extension of number fields.  However, for some applications, it is necessary to know not just that such primes exist, but to additionally know something about their size, say in terms of the degree and discriminant of the extension.  In this talk, I'll discuss forthcoming work with Cho and Zaman on the least prime with a specified Frobenius in a fixed Galois extension, with a particular focus on S_n extensions.  Our approach is comparatively elementary, but when combined with existing results based on the zeros of L-functions, it leads to the strongest known bounds in this setting.


Sep 18


Sep 25


Oct 2


Oct 9


Oct 16

Qiao He (Columbia)


Oct 23


Oct 30

Beilinson-Bloch-Kato conjecture for polarized motives
Hao Peng (MIT)
The Beilinson—Bloch—Kato conjecture is a far-fetching generalization of the (rank part of the) BSD conjecture for modular elliptic curves. The conjecture is partially proved for U(N)*U(N+1)-motives in the work of Y. Liu, Y. Tian, L. Xiao, W. Zhang, and X. Zhu. Using theta correspondence, we prove that their result implies the BBK conjecture for U(2n)-motives, e.g. odd symmetric powers of non-CM modular elliptic curves, in the rank zero case. Similar trick works in the orthogonal case. If time permits, we talk about the work in progress partiallu proving the BBK conjecture for O(N)*O(N+1)-motives when analytic rank is at most one.


Nov 6


Nov 13


Nov 20


Dec 4


Dec 11


Dec 18