Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Department of Mathematical Sciences

Research Seminar Series

Applied Mathematics Seminars

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Arithmetic Study Group

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Centre for Particle Theory Colloquia

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Computing Seminars/Talks

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


CPT Student Seminar

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Departmental Research Colloquium

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Distinguished Lectures and Public Lectures

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Geometry and Topology Seminar

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Informal HEP Journal club

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Maths HEP Lunchtime Seminars

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Pure Maths Colloquium

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Statistics Seminars

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information


Stats4Grads

Arithmetic Study Group: Better than squareroot cancellation for multiplicative functions

Presented by Adam Harper, Warwick University

7 November 2017 14:00 in CM 219

It is a standard heuristic that sums of oscillating number theoretic functions, like the Mobius function or Dirichlet characters, should exhibit squareroot cancellation as compared with trivial bounds. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will try to explain some recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.

Contact athanasios.bouganis@durham.ac.uk or pankaj.vishe@durham.ac.uk for more information