{"id":671,"date":"2025-02-27T10:11:11","date_gmt":"2025-02-27T10:11:11","guid":{"rendered":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/?page_id=671"},"modified":"2025-06-11T13:04:33","modified_gmt":"2025-06-11T13:04:33","slug":"workshop-number-theory","status":"publish","type":"page","link":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/","title":{"rendered":"Number Theory"},"content":{"rendered":"\n<p class=\"has-medium-font-size\"><strong>Monday 23rd June<\/strong>, Newman Red (WSNT1)<\/p>\n\n\n\n<p>15:10 &#8211; 15:50 <a href=\"https:\/\/www.andrewpearcecrump.com\/\">Andrew Pearce-Crump<\/a> (Bristol)<br>15:50 &#8211; 16:30 <a href=\"https:\/\/sites.google.com\/view\/jessepajwani\/Jesse-Pajwani\">Jesse Pajwani<\/a> (Bath)<br>16:30 &#8211; 17:10 <a href=\"https:\/\/chriswilliams1404.wixsite.com\/website\">Chris Williams<\/a> (Nottingham)<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><strong>Tuesday 24th June<\/strong>, Newman Red (WSNT2)<\/p>\n\n\n\n<p>15:40 &#8211; 16:20 <a href=\"https:\/\/sites.google.com\/view\/cmaistret\/home\">Celine Maistret<\/a> (Bristol)<br>16:20 &#8211; 17:00 <a href=\"https:\/\/sites.google.com\/view\/natalieevans\/home\">Natalie Evans<\/a> (KCL)<br>17:00 &#8211; 17:40  <a href=\"https:\/\/sites.google.com\/site\/robkurinczuk\/home\">Robert Kurinczuk<\/a> (Sheffield)<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><strong>Wednesday 25th June<\/strong>, Newman Red (WSNT3)<\/p>\n\n\n\n<p>15:40 &#8211; 16:00 <a href=\"https:\/\/sites.google.com\/view\/thomas-karam\">Thomas Karam<\/a> (Oxford)<br>16:05 &#8211; 16:25 <a href=\"https:\/\/experts.exeter.ac.uk\/35716-madhuparna-das\">Madhuparna Das<\/a> (Exeter)<br>16:30 &#8211; 16:50 <a href=\"https:\/\/sites.google.com\/view\/zainahmedkapadia\/about\">Zain Kapadia<\/a> (Queen Mary)<br>16:55 &#8211; 17:15 <a href=\"https:\/\/multramate.github.io\/\">David Kurniadi Angdinata<\/a> (UCL)<br>17:20 &#8211; 17:40 Harvey Gray and Hollie Davis (Exeter)<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><strong>Titles and Abstracts<\/strong><\/p>\n\n\n\n<p><strong>David Kurniadi Angdinata &#8211; Elliptic divisibility sequences in Lean<br><\/strong>Elliptic divisibility sequences are integer sequences satisfying a certain cyclic recurrence relation, which are crucial in the algebraic theory of division polynomials used in elliptic curve cryptography algorithms. In this talk, I will explain their construction and our subsequent formalisation in the Lean theorem prover, including how we inadvertently discovered a massive gap in the literature. This is joint work with Junyan Xu.<\/p>\n\n\n\n<p><strong>Madhuparna Das &#8211; Exponential Sums with Additive Coefficients and its Consequences to Weighted Partitions<br><\/strong>In this article, we consider the weighted partition function <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p_f%28n%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p_f(n)\" class=\"latex\" \/> given by the generating series <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Csum_%7Bn%3D1%7D%5E%7B%5Cinfty%7D+p_f%28n%29z%5En+%3D+%5Cprod_%7Bn%5Cin%5Cmathbb%7BN%7D%5E%7B%2A%7D%7D%281-z%5En%29%5E%7B-f%28n%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;sum_{n=1}^{&#92;infty} p_f(n)z^n = &#92;prod_{n&#92;in&#92;mathbb{N}^{*}}(1-z^n)^{-f(n)}\" class=\"latex\" \/>, where we restrict the class of weight functions to strongly additive functions. Originally proposed in a paper by Yang, this problem was further examined by Debruyne and Tenenbaum for weight functions taking positive integer values, which has recently been generalized by Bridges et al. We establish an asymptotic formula for this generating series in a broader context, which notably can be used for the class of multiplicative functions. Moreover, we employ a classical result by Montgomery-Vaughan to estimate exponential sums with additive coefficients, supported on minor arcs.<\/p>\n\n\n\n<p><strong>Natalie Evans &#8211; Correlations of almost primes<br><\/strong>The Hardy-Littlewood generalised twin prime conjecture states an asymptotic formula for the number of primes <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p%5Cleq+X&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p&#92;leq X\" class=\"latex\" \/> such that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p%2Bh&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p+h\" class=\"latex\" \/> is prime, where <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"h\" class=\"latex\" \/> is any non-zero even integer. While this conjecture remains wide open, Matom\u00e4ki, Radziwi\u0142\u0142 and Tao proved that it holds on average over <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"h\" class=\"latex\" \/>, improving on a previous result of Mikawa. In this talk we will discuss an almost prime analogue of the Hardy-Littlewood conjecture for which we can go beyond what is known for primes. We will describe some work in which we prove an asymptotic formula for the number of almost primes <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%3Dp_1p_2+%5Cleq+X&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n=p_1p_2 &#92;leq X\" class=\"latex\" \/> such that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n%2Bh&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n+h\" class=\"latex\" \/> has exactly two prime factors which holds for a very short average over <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"h\" class=\"latex\" \/>.<\/p>\n\n\n\n<p><strong>Harvey Gray and Hollie Davis &#8211; Employment of AI on pure mathematics education<br><\/strong>The artificial intelligence sector has been proven on numerous occasions to be a viable way of aiding students\u2019 educational experience by serving as a digital personal tutor. Our presentation investigates to what effect ChatGPT can have on pure mathematics education. This presentation investigates ChatGPT\u2019s fluency with LEAN. LEAN is an interactive theorem prover that enables mathematical proof to be written and interpreted on a computer. LEAN has been credited to be a breakthrough in the future of pure mathematics education and is gradually being enrolled into the curriculum of mathematics programs at universities. In the initial stages of primary research, we challenge ChatGPT with different pure mathematics problems in the realm of propositional logic, a topic that beginning mathematics undergraduates are introduced to. We then investigate the LEAN solutions it provides and verify their validity. This leads to a firm understanding of ChatGPT\u2019s fluency with LEAN, allowing us to understand the challenges that are associated with developing a CustomGPT that will help students write mathematical proof in LEAN. Rigorous development and testing is performed on the CustomGPT in the form of flowcharts and written instructions in order to assess its capability and its limitations. From this process, we conclude to what extent the CustomGPT can act as a digital personal tutor for the students\u2019 education in pure mathematics.<\/p>\n\n\n\n<p><strong>Zain Kapadia &#8211; Some Uniserial Specht Modules<br><\/strong>The Representation Theory of the Symmetric Groups is a classical and rich area of combinatorial representation theory. Key objects of study include Specht modules, the irreducible ordinary representations, which can be reduced modulo <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/> (for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/> prime). In general, these are no longer irreducible and finding their decomposition numbers and submodule structures are key questions in the area. We give sufficient and necessary conditions for a Specht module in characteristic <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"2\" class=\"latex\" \/>, labelled by a hook partition to be a direct sum of uniserial summands.<\/p>\n\n\n\n<p><strong>Thomas Karam &#8211; The amount and type of structure of a function in terms of its small images<br><\/strong>It is well known that if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> is an abelian group and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> is a finite subset of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> which minimises the size of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A%2BA&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A+A\" class=\"latex\" \/> for a fixed size of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/>, then <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> must essentially be as close as possible to being a coset of some subgroup of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/>: for instance, if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> is finite then the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> must be a coset in <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> (provided that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> has subgroups with size <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Clvert+A+%5Crvert&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;lvert A &#92;rvert\" class=\"latex\" \/>), and if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G%3D%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G=&#92;mathbb{Z}\" class=\"latex\" \/> then the set <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> must be an arithmetic progression. One may wish to describe an extension of this phenomenon to more arbitrary functions than addition on abelian groups. If <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"X\" class=\"latex\" \/> is a set and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F%3A+X+%5Ctimes+X+%5Crightarrow+X&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F: X &#92;times X &#92;rightarrow X\" class=\"latex\" \/> is a function, then can the structure of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F\" class=\"latex\" \/> (to the extent that there is some) be read from the structure of the subsets <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"X\" class=\"latex\" \/> minimising the size of the image <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F%28A%2CA%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F(A,A)\" class=\"latex\" \/> for a fixed size of A, and can the &#8220;amount of structure&#8221; of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F\" class=\"latex\" \/> be read from how quickly that minimal size grows with the size of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/>? We will discuss the progress that has been made in this direction, starting with the results of Elekes-Ronyai, and what remains to be understood.<\/p>\n\n\n\n<p><strong>Robert Kurinczuk &#8211; Finiteness for Hecke algebras of <em>p<\/em>-adic groups<\/strong><br>Let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/> be a <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>-adic group and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=K&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"K\" class=\"latex\" \/> a compact open subgroup of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"G\" class=\"latex\" \/>. Over forty years ago, Bernstein proved that the Hecke algebra <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D%5BK%5Cbackslash+G%2FK%5D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;mathbb{C}[K&#92;backslash G\/K]\" class=\"latex\" \/> is a finitely generated module over its centre and that its centre is a finitely generated <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;mathbb{C}\" class=\"latex\" \/>-algebra.&nbsp; It has long been expected that analogues of Bernstein&#8217;s result should hold over other coefficient rings.&nbsp; In joint work with Dat, Helm, and Moss, we established such analogues of Bernstein&#8217;s finiteness results after inverting <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>.&nbsp; The key ingredient which unlocked the problem was Fargues and Scholze&#8217;s geometrization of the local Langlands correspondence.&nbsp; We will explain some of the main ideas from this approach, and time permitting discuss some current work in progress on Local Langlands in Families.<\/p>\n\n\n\n<p><strong>Celine Maistret &#8211; Galois module structure of Tate-Shafarevich groups of elliptic curves<br><\/strong>For an elliptic curve <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E%2F+%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\/ &#92;mathbb{Q}\" class=\"latex\" \/>, computing its Tate-Shafarevich group is a fundamental but hard problem. Assuming its finiteness, the Birch and Swinnerton-Dyer conjecture (BSD) provides a formula for its size in terms of the special value of the L-function of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E%2F%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\/&#92;mathbb{Q}\" class=\"latex\" \/> and some arithmetic invariants of the curve. If <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=K%2F%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"K\/&#92;mathbb{Q}\" class=\"latex\" \/> is a Galois extension, one can ask if a BSD-like formula can be used to link the Galois module structure of the Tate-Shafarevich group of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E%2FK&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\/K\" class=\"latex\" \/> to the special value of the twisted <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L\" class=\"latex\" \/>-function of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E%2F%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\/&#92;mathbb{Q}\" class=\"latex\" \/> by an Artin representation associated to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=K%2F%5Cmathbb%7BQ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"K\/&#92;mathbb{Q}\" class=\"latex\" \/>. In this talk, I will present a joint work with Himanshu Shukla, where we give an explicit conjecture for such a link in the case of primitive Dirichlet characters and provide numerical verifications obtained via 11-descent procedures over <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=C_5&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"C_5\" class=\"latex\" \/>-extensions.<\/p>\n\n\n\n<p><strong>Jesse Pajwani &#8211; Symmetric powers of trace forms<\/strong><br>Fix <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/> to be a field of characteristic not <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"2\" class=\"latex\" \/> and let <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L%2Fk&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L\/k\" class=\"latex\" \/> be a finite separable field extension. The Galois trace map <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%7B%5Crm+Tr%7D%5Ccolon+L+%5Crightarrow+k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"{&#92;rm Tr}&#92;colon L &#92;rightarrow k\" class=\"latex\" \/> gives rise to a quadratic form <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%7B%5Crm+Tr%7D_L&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"{&#92;rm Tr}_L\" class=\"latex\" \/> on <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L\" class=\"latex\" \/>, viewed as a <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/> vector space, given by sending <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"x\" class=\"latex\" \/> to <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%7B%5Crm+Tr%7D%28x%5E2%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"{&#92;rm Tr}(x^2)\" class=\"latex\" \/>. This construction extends to finite \u00e9tale algebras over <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/>, so it is a natural question to ask whether this is compatible with operations on finite \u00e9tale algebras over <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"k\" class=\"latex\" \/>. In particular, if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A\" class=\"latex\" \/> is a finite \u00e9tale algebra, we can form the symmetric product <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=A%5E%7B%28n%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"A^{(n)}\" class=\"latex\" \/>, which is also a finite \u00e9tale algebra. In this talk, we investigate the notion of a &#8220;symmetric power of quadratic forms&#8221; and show that <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%7B%5Crm+Tr%7D_%7BA%5E%7B%28n%29%7D%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"{&#92;rm Tr}_{A^{(n)}}\" class=\"latex\" \/> is given by a strange symmetric power of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%7B%5Crm+Tr%7D_A&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"{&#92;rm Tr}_A\" class=\"latex\" \/>, using results by Garibaldi-Merkurjev-Serre. If there is time at the end, we may discuss a higher dimensional analogue of this question, which concerns an arithmetic enhancement of the Euler characteristic of a variety. This is joint work with Ambrus P\u00e1l.<\/p>\n\n\n\n<p><strong>Andrew Pearce-Crump &#8211; Number Theory versus Random Matrix Theory: the joint moments story<\/strong><br>It has been known since the 80s, thanks to Conrey and Ghosh, that the average of the square of the Riemann zeta function, summed over the extreme points of zeta up to a height <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"T\" class=\"latex\" \/>, is <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cfrac%7B1%7D%7B2%7D+%28e%5E2-5%29+%5Clog+T&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;frac{1}{2} (e^2-5) &#92;log T\" class=\"latex\" \/> as <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=T+%5Crightarrow+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"T &#92;rightarrow &#92;infty\" class=\"latex\" \/>. This problem and its generalisations are closely linked to evaluating asymptotics of joint moments of the zeta function and its derivatives, and for a time was one of the few cases in which Number Theory could do what Random Matrix Theory could not. RMT then managed to retake the lead in calculating these sorts of problems, but we may now tell the story of how Number Theory is fighting back, and in doing so, describe how to find a full asymptotic expansion for this problem, the first of its kind for any nontrivial joint moment of the Riemann zeta function. This is joint work with Chris Hughes and Solomon Lugmayer.<\/p>\n\n\n\n<p><strong>Chris Williams &#8211; The exceptional zero conjecture for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cmathbf%7BGL%7D%283%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;mathbf{GL}(3)\" class=\"latex\" \/><\/strong><br>The BSD conjecture predicts that a rational elliptic curve <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\" class=\"latex\" \/> has infinitely many points if and only if its <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L\" class=\"latex\" \/>-function vanishes at <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=s%3D1&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"s=1\" class=\"latex\" \/>. Iwasawa theory is concerned with <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>-adic analogues of this phenomena. If <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\" class=\"latex\" \/> is <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>-ordinary, there is, for example, a <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>-adic analytic analogue <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L_p%28E%2Cs%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L_p(E,s)\" class=\"latex\" \/> of the <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L\" class=\"latex\" \/>-function; and if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\" class=\"latex\" \/> has good reduction at <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>, then <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L_p%28E%2C1%29%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L_p(E,1)=0\" class=\"latex\" \/> if and only if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L%28E%2C1%29%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L(E,1)=0\" class=\"latex\" \/>. However if <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"E\" class=\"latex\" \/> has split multiplicative reduction at <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>, then <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L_p%28E%2C1%29%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L_p(E,1)=0\" class=\"latex\" \/> for trivial reasons, regardless of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L%28E%2C1%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L(E,1)\" class=\"latex\" \/>; it has an &#8216;exceptional zero&#8217;. Mazur-Tate-Teitelbaum&#8217;s &#8216;exceptional zero conjecture&#8217; (proved by Greenberg&#8211;Stevens in &#8217;93) states that in this case the first derivative <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L_p%27%28E%2C1%29%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L_p&#039;(E,1)=0\" class=\"latex\" \/> if and only <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=L%28E%2C1%29%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"L(E,1)=0\" class=\"latex\" \/>. They used this to formulate a precise <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"p\" class=\"latex\" \/>-adic BSD conjecture. In this talk I will discuss exceptional zero phenomena, and describe joint work in progress with Daniel Barrera and Andy Graham proving the exceptional zero conjecture for <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cmathrm%7BGL%7D%283%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;mathrm{GL}(3)\" class=\"latex\" \/>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Monday 23rd June, Newman Red (WSNT1) 15:10 &#8211; 15:50 Andrew Pearce-Crump (Bristol)15:50 &#8211; 16:30 Jesse Pajwani (Bath)16:30 &#8211; 17:10 Chris Williams (Nottingham) Tuesday 24th June, Newman Red (WSNT2) 15:40 &#8211; 16:20 Celine Maistret (Bristol)16:20 &#8211; 17:00 Natalie Evans (KCL)17:00 &#8211; 17:40 Robert Kurinczuk (Sheffield) Wednesday 25th June, Newman Red (WSNT3) 15:40 &#8211; 16:00 Thomas Karam [&hellip;]<\/p>\n","protected":false},"author":2141,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-sidebar-boxed-feature-img.php","meta":{"_acf_changed":false,"footnotes":""},"categories":[],"tags":[],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v23.0 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Number Theory - BMC-BAMC 2025<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Number Theory - BMC-BAMC 2025\" \/>\n<meta property=\"og:description\" content=\"Monday 23rd June, Newman Red (WSNT1) 15:10 &#8211; 15:50 Andrew Pearce-Crump (Bristol)15:50 &#8211; 16:30 Jesse Pajwani (Bath)16:30 &#8211; 17:10 Chris Williams (Nottingham) Tuesday 24th June, Newman Red (WSNT2) 15:40 &#8211; 16:20 Celine Maistret (Bristol)16:20 &#8211; 17:00 Natalie Evans (KCL)17:00 &#8211; 17:40 Robert Kurinczuk (Sheffield) Wednesday 25th June, Newman Red (WSNT3) 15:40 &#8211; 16:00 Thomas Karam [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/\" \/>\n<meta property=\"og:site_name\" content=\"BMC-BAMC 2025\" \/>\n<meta property=\"article:modified_time\" content=\"2025-06-11T13:04:33+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"8 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/\",\"url\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/\",\"name\":\"Number Theory - BMC-BAMC 2025\",\"isPartOf\":{\"@id\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/#website\"},\"datePublished\":\"2025-02-27T10:11:11+00:00\",\"dateModified\":\"2025-06-11T13:04:33+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Number Theory\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/#website\",\"url\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/\",\"name\":\"BMC-BAMC 2025\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Number Theory - BMC-BAMC 2025","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/","og_locale":"en_US","og_type":"article","og_title":"Number Theory - BMC-BAMC 2025","og_description":"Monday 23rd June, Newman Red (WSNT1) 15:10 &#8211; 15:50 Andrew Pearce-Crump (Bristol)15:50 &#8211; 16:30 Jesse Pajwani (Bath)16:30 &#8211; 17:10 Chris Williams (Nottingham) Tuesday 24th June, Newman Red (WSNT2) 15:40 &#8211; 16:20 Celine Maistret (Bristol)16:20 &#8211; 17:00 Natalie Evans (KCL)17:00 &#8211; 17:40 Robert Kurinczuk (Sheffield) Wednesday 25th June, Newman Red (WSNT3) 15:40 &#8211; 16:00 Thomas Karam [&hellip;]","og_url":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/","og_site_name":"BMC-BAMC 2025","article_modified_time":"2025-06-11T13:04:33+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"8 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/","url":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/","name":"Number Theory - BMC-BAMC 2025","isPartOf":{"@id":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/#website"},"datePublished":"2025-02-27T10:11:11+00:00","dateModified":"2025-06-11T13:04:33+00:00","breadcrumb":{"@id":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/workshop-number-theory\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/"},{"@type":"ListItem","position":2,"name":"Number Theory"}]},{"@type":"WebSite","@id":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/#website","url":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/","name":"BMC-BAMC 2025","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/pages\/671"}],"collection":[{"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/users\/2141"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/comments?post=671"}],"version-history":[{"count":18,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/pages\/671\/revisions"}],"predecessor-version":[{"id":1401,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/pages\/671\/revisions\/1401"}],"wp:attachment":[{"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/media?parent=671"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/categories?post=671"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.exeter.ac.uk\/bmc-bamc2025\/wp-json\/wp\/v2\/tags?post=671"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}