1) Additive rearrangements and sequenceability in finite groups
2) Additive and extremal combinatorics, especially anticoncentration, zero-sum problems, and distinct sums
3) Algebraic and tensor methods in combinatorics, including slice rank and partition rank
4) Coding theory and perfect hashing
5) Graph embeddings and decompositions
EARLIER RESEARCH
Finite geometry and blocking sets; combinatorial designs and difference families
1) Ningbo University (Ningbo, China): X. Wang
2) Beijing Jiaotong University (Beijing, China): Y. Chang, T. Feng and H. Liu
3) Princeton University (Princeton, USA): E. R. Engel
4) Marlboro College (Marlboro, USA): S. Rovner-Frydman
5) Emerson College (Boston, USA): M. A. Ollis
6) University of Palermo (Palermo, Italy): M. Pavone
7) Universitat Politècnica de Catalunya (Barcelona, Spain): L. Vena
8) Universitas Mercatorum (Rome, Italy): M. Fontana
9) University of Perugia (Perugia, Italy): M. Buratti
10) University of Modena and Reggio Emilia (Modena, Italy): L. Mella
11) University of Parma (Parma, Italy): F. Morini
12) Catholic University of Milan, DMF (Brescia, Italy): M. A. Pellegrini and S. Pianta
13) University of Brescia, DII (Brescia, Italy): M. Dalai and S. Della Fiore
14) University of Brescia, DICATAM (Brescia, Italy): A. Ferraguti, A. Pasotti and T. Traetta