Research: Number Theory
Summer School 2021: Applications of Expander Graphs to Number Theory and Computer Science, May 24-28.
From May 24 to 28, 2021, the University of North Carolina Greensboro will host the UNCG Summer School in Computational Number Theory and Algebra: Applications of Expander Graphs to Number Theory and Computer Science.
Expanders are graphs satisfying very strong connectivity properties. There are precise definitions, but, roughly speaking, every “small” set of vertices in an expander has “many” neighbors outside that set. We will introduce expanders and then explore the many connections they have to topics in number theory and computer science.
The school will run in morning and afternoon zoom sessions for the five days between May 24 and May 28, 2021. In each session, one of our well-known speakers will give a lecture. Then everyone will break into small zoom groups to work on problem sets together with mentors. All problems are aimed at increasing the students’ understanding of the material by working with it. At the end of each session, the whole school will reconvene to talk over the results and for further insight. The talks early in the week will introduce the students to the subject and those later in the week cover related areas of current research and unsolved problems.
This school is targeted primarily to early stage graduate students in mathematics with an interest in number theory.
Click here for a flier to post: UNCG_expander_school_2021
- Irit Dinur, Weizman Institute of Science
- Alex Kontorovich, Rutgers University
- Emmanuel Kowalski, ETH Zürich
Definitions – combinatorial expansion, laplacian spectrum, random walks.
Constructions – randomized constructions, Cayley graphs, Ramanujan graphs, the Zig-Zag Product.
Applications – survey, sieves in discrete groups, Apollonian circle packings, arithmetic geometry, error correcting codes.
Monday May 24 to Friday May 28, 2021.
Mornings: 9 AM – 11:30 AM, Eastern Standard Time
Afternoons: 1 PM – 3:30 PM, Eastern Standard Time
Schedule per session: 50 minutes of lecture, 80 minutes of problem solving in small mentored groups, 20 minutes of large group discussion
All sessions meet by zoom, check your email for the link. All times are Eastern Standard Time.
9 AM-11:30 AM Lecture 1 (Kowalski) Basic graph theory, combinatorial definition of expanders.
1 PM – 3:30 PM Lecture 2 (Kowalski) Spectral definition, equivalence of definitions.
9 AM-11:30 AM Lecture 3 (Kowalski) Types of expanders, Cayley graphs, random graphs.
1 PM – 3:30 PM Lecture 4 (Kontorovich) Apollonian packings.
9 AM-11:30 AM Lecture 5 (Dinur) The zig-zag product.
1 PM – 3:30 PM Lecture 6 (Kontorovich) Zaremba problem.
3:45 PM Social event.
9 AM-11:30 AM Lecture 7 (Dinur) Application to error-correcting codes.
1 PM – 3:30 PM Lecture 8 (Kontorovich) Circle methods, sieve methods.
9 AM-11:30 AM Lecture 9 (Kowalski) Proofs of equidistribution and sketch of some applications.
1 PM – 3:30 PM Lecture 10 (Kontorovich) Infinite volume counting methods.
3:45 Social event.
Lecture Notes, Problem Sets, and Lecture Recordings
Lecture 4 papers:
Lecture 5 links:
–MPS Conference on High Dimensional Expanders (lots of videos about the state of the art in 2019)
Lecture 6 papers:
–Discussion of Zaremba+McMullen+ELMV (skip past the first two lectures on topics not covered)
–Main Zaremba paper (don’t really try to read this; it’s pretty hard…)
Lecture 8 papers: