Computational Aspects of Lfunctions
(November 913, 2015)
This conference will revolve around several themes: the computational complexity of Lfunctions; statistical problems concerning Lfunctions, such as the distribution of their values, and zeros, moments of Lfunctions, statistics and size of ranks in families of elliptic curves; practical implementations of algorithms and their applications to testing various conjectures about Lfunctions; rigorous and certifiable computations of Lfunctions. One goal is to stimulate dialogue between theoreticians and computationally minded researchers regarding problems to which computation might provide insight or important confirmation of conjectures. In the other direction, we hope that discussions will lead to new ideas concerning algorithms for Lfunctions.
Organizing Committee
 Valentin Blomer
(Universität Göttingen)  Brian Conrey
(American Institute of Mathematics)  Chantal David
(Concordia University)  David Farmer
 Michael Rubinstein
(University of Waterloo)  Peter Sarnak
(Princeton University)

{{p.person.firstName}} {{p.person.lastName}}
{{p.person.firstName}} {{p.person.lastName}}
({{p.person.temp_org_dept.organization_name}})
= speaker = poster presenter