Due to unforeseen circumstances this event has been postponed until 2021. Apologies for any inconvenience.
Archive | Events
Joshua Cape
19 December 2019, 3:30- 4:30, The Fry building G.07 Joshua is a NSF Postdoctoral Research Fellow from the University of Michigan. His paper ‘The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, Joshua Cape, Minh Tang, and Carey E. Priebe, Annals of Statistics (2019), vol. 47, no. 5, pp. 2405–2439.” was one […]
Colloquium – Proffessor Delaram Kahrobaei, University of York
Title: Interactions between Group Theory, Cyber Security, Artificial Intelligence and Quantum Computation
Abstract:
In this talk, I explore how group theory plays a crucial role in data science and artificial intelligence as well as cyber security and quantum computation; at the same time, computer science and machine learning could help group theorists tackle some of their open problems. A second theme of the talk will be to formulate graph theoretic problems associated with computational complexity as group theoretic questions pertaining to graph groups. Lastly, we will look at the question of whether certain group-based cryptographic schemes are quantum-safe.
Brief bio:
Professor Delaram Kahrobaei holds the Chair of Cyber Security at the University of York. Prior to that, she was a Full Professor at the City University of New York. She is President and co-founder of the start-up, Infoshield Inc., and director of the York Interdisciplinary Centre for Cyber Security Research. She is an Associate Editor of Advances of Mathematics of Communication, and Chief Editor of the International Journal of Computer Mathematics: Computer Systems Theory. Her main research areas are Post-Quantum Algebraic Cryptography, Information Security, Data Science and Applied Algebra.
Further information
The talk will be held in the Fry Building, room 2.41, from 4pm – 5pm and will be followed by a drinks reception in the Maths common room.
The event is open to University of Bristol staff and students, as well as the general public.
To help us plan numbers, we ask that you please register in advance via Eventbrite.
Duffin- Schaeffer Conjecture
16th- 18th December Bristol University, The Fry Building Organiser: Demi Allen The workshop will feature a colloquium by James Maynard, a series of lectures on the proof of the Duffin-Schaeffer Conjecture by Dimitris Koukoulopoulos and James Maynard, some open problems sessions, and several other talks by experts (confirmed speakers include: Christoph Aistleitner, Victor Beresnevich, Andy […]
Heilbronn Colloquium – James Maynard
16th December 2019 University of Bristol We are very pleased to welcome James Maynard to the University of Bristol for a Heilbronn colloquium. James is primarily interested in classical number theory, in particular the distribution of prime numbers. His research focuses on using tools from analytic number theory, particularly sieve methods, to study primes. Title: […]
Heilbronn Colloquium – Maynard
16th December 2019
University of Bristol
We are very pleased to welcome James Maynard to the University of Bristol for a Heilbronn colloquium.
James is primarily interested in classical number theory, in particular the distribution of prime numbers. His research focuses on using tools from analytic number theory, particularly sieve methods, to study primes.
Title: Approximating reals by fractions
Abstract: How well can you approximate real numbers by fractions with denominators coming from a given set? Although this old question has applications in many areas, in general this question seems impossibly hard – we don’t even know whether e+pi is rational or not!
If you allow for a tiny number of bad exceptions, then a beautiful dichotomy occurs – either almost everything can be approximated or almost nothing! I’ll talk about this problem and recent joint work with Dimitris Koukoulopoulos which classifies when these options occur, answering an old question of Duffin and Schaeffer. This relies on a fun blend of different ideas, including ergodic theory, analytic number theory and graph theory.
The colloquium will take place in Lecture theatre 2.41, Fry Building at 16:00- 17:00 on Monday 16th December followed by a wine reception in the Fry Common room. To help us plan catering, please complete the short registration form if you are planning to attend the colloquium.
Heilbronn Annual Conference 2019
12 – 13 September 2019
University of Bristol
The Heilbronn Institute for Mathematical Research welcomes a distinguished selection of speakers for the 2019 conference.
Melody Chan, Brown
Hugo Duminil – Copin, IHES
Emmanuel Kowalski, ETZ Zürich
Holly Krieger, Cambridge
Kannan Soundararajan, Stanford
Leslie Valiant, Harvard
Bianca Viray, University of Washington
Julia Wolf, Cambridge
Please register using the form here by Monday 2nd September 2019.
Funding has been secured to support a limited number of PhD and Early Career Researchers. Please apply using the relevant section of the registration form. We also welcome applications for caring costs.*
*Applies to expenses incurred exceptionally as a result of attending the conference.
Please see here for the programme.
Noncommutative mathematics and quantum information
8-10 August 2019
Location: Engineers House
The programme can be viewed here.
These workshops are by invitation only.
Noncommutative mathematics and quantum information
8-10 August 2019 Location: Engineers House The programme can be viewed here. These workshops are by invitation only.
DISTINGUISHED LECTURE SERIES ELLENBERG
15 – 17 May 2019 University of Bristol
We are pleased to announce we will be hosting two Distinguished Lecture Series in 2019, the second of which will be given by Jordan Ellenberg.
The talks will be over three days:
15th May, Colloquium in SM1, Maths Building, 16.00 followed by wine reception in Maths Common Room
16th May SM2, Maths Building 16.00
17th May, SM2, Maths Building 16:00
Please register for the colloquium here
Registration not required for the talks of the 16th and 17th May.
Colloquium Title and Abstract:
Title: Caps, sets, lines, ranks, polynomials, and (the absence of) arithmetic progressions Abstract: Here is an innocent-looking problem. Suppose you wish to construct a subset of the numbers from 1 to 1,000,000 — or, more generally, from 1 to some large number N — with the property that no three of the numbers ever form an arithmetic progression. How big can your subset be? It’s not clear that this problem is hard and it’s not clear that it’s important. In fact it is both! I’ll talk about the long history of this problem and its variants, including the “cap set” problem, which is related to the card game Set: how many cards can be on the table if there is no legal play? This problem sounds different but is in many ways the same. I’ll talk about a sudden burst of progress on the cap set problem that took place in 2016, and explain what it all has to do with polynomials over finite fields, spinning needles (they’re also over finite fields), notions of rank for NxNxN “matrices”, and the data science of embedding points in space.
Support for travel for UK based PhD students may be available, please contact heilbronn-coordinator@bristol.ac.uk with any requests by 15th April.
We are pleased to announce that we are able to consider applications for funding to support care costs*
This event is organised in collaboration with the Heilbronn Institute of Mathematical Research.
*Applies to expenses incurred exceptionally as a result of attending the lecture series. Please contact heilbronn-coordinator@bristol.ac.uk for further information.
