Results 391 - 400 of 24711

The first instance of the strong convergence phenomenon was established by Haagerup and Thorbjornsen in the context of operator algebras more than two decades ago. Since then, the strong convergence phenomenon has emerged naturally in connection with a variety of topics across mathematics, including expander graphs, spectral gaps for manifolds, and constrained minimal surfaces.
This mini-course will have the following objectives:
i) Introduce and motivate the notion of strong convergence.
ii) Discuss recent proof techniques.
iii) Showcase concrete applications.

High-dimensional expansion (HDX) is a generalization of expansion in graphs to higher dimensions (i.e., hypergraphs). In recent years, HDXs have already seen a lot of amazing applications in areas such as error-correcting codes, bounding the mixing time of Markov chains and probabilistically checkable proofs (PCPs), and in explicit constructions of vertex expanders.

This mini-course aims to cover the basics of HDX and will follow this outline:
Lecture 1: We will start by defining the spectral notion of HDX, prove the trickling down theorem and define random walks on HDX.
Lectures 2 & 3: Show the Kaufman-Oppenheim construction of HDX. Time-permitting we will also cover an application to agreement testing, which is an important component of PCP constructions.

We will discuss the structure versus randomness paradigm: the idea that an arbitrary mathematical object (like a graph, function, or set) can often be decomposed into a usefully structured part and a certifiably pseudorandom part. In contrast to problems centered on the explicit construction of pseudorandom objects, here the objects are given to us, and the task is to find the pseudorandomness inside them. The first part of the lectures will be about how this is done, starting with Roth's theorem on three-term arithmetic progressions and then looking at density increment and regular decomposition arguments more generally. In the second part, we will discuss the problem of comparing two given notions of pseudorandomness and understanding how they relate, for instance by way of inverse theorems. This turns out to occupy much of the subject, in part because the notions we are forced to work with when finding pseudorandomness in arbitrary objects are relatively weak ones.

We will explore the pseudorandomness toolkit: the basic objects and techniques used to construct pseudorandom generators and prove various other derandomization results. Topics will include bounded independence, small-bias spaces, randomness extractors, expander graphs, and random restrictions. We will present some of the key constructions and their applications, and see how these ingredients fit together in the main challenges in pseudorandomness. Time permitting, we will also give some ideas being more advanced results, and discuss some open problems.

Slides: https://drive.google.com/file/d/1kTCg4Y5SGmmEejjfvuzJFHZ6ERlYkuGk/view