NSF Award
2326685
A broad variety of phenomena in computation can be viewed as different forms of “expansion”, which ensure that local properties which can be observed by looking at small parts of an object, can be used to influence and understand global properties exhibited at a much larger scale. This is an important design requirement in several applications, such as (1) classical and quantum error-correction, where one wants errors to be easily detectable by local checks, (2) optimization problems, where one wants local choices to push the global solution towards optimality, and (3) geometric embeddings of high-dimensional data, where one wants to use local (low-dimensional) conditions to influence high-dimensional behavior. In the past few years, several new concepts and techniques have emerged to study expansion phenomena in different contexts. This project aims to study several different forms of expansion phenomena in a unified way, with an emphasis on applications in the areas of error-correcting codes and (approximate) optimization. This research is likely to lead to new connections between multiple areas where such phenomena are useful. The material generated as part of this research will also be disseminated through surveys and a series of expository videos.<br/> <br/>This project aims to obtain a unified view of the following different forms and applications of expansion phenomena:<br/>- Classical notions of graph expansion and novel notions of high-dimensional expansion for hypergraphs, and their connections to recent advances in coding theory.<br/>- Applications of classical expansion phenomena to quantum codes, as well as quantum extensions of classical expansion phenomena.<br/>- Connections of high-dimensional expansion to the study and approximability of expansion phenomena in geometric spaces, and related problems about fine-grained graph expansion.<br/>The research directions pursued in this project aim to introduce new techniques in algorithmic coding theory and in the study of approximability of discrete and continuous optimization problems. The project considers several problems that have proved to be bottlenecks for current algorithmic and analytic techniques, explores new approaches arising from the study of expansion in a different context. The project aims to apply these ideas for the design of new error-correcting codes, and new algorithms for existing codes, towards the design of new pseudorandom objects, and also new families of combinatorial and geometric instances for proving inapproximability results.<br/><br/>This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
