Philippe Moustrou

I am currently a PostDoc in the Algebra group led by Cordian Riener in the department of Mathematics and Statistics in Tromsø.
I defended my PhD in December 2017, I was in the number theory team of the Institut de Mathématiques de Bordeaux and the "graph and optimization" team of the LaBRI, under the supervision of Christine Bachoc and Arnaud Pêcher.
In 2018, I was a PostDoc at ICERM, Brown University for the semester program Point Configurations in Geometry, Physics and Computer Science.

Research

My research concerns both theoretical and computational questions in several topics, ranging from number theory to polynomial optimization, going through discrete geometry, coding theory and real algebraic geometry. I am particularly excited by questions involving lattices and sphere packings.

Preprints & Publications

Exact semidefinite programming bounds for packing problems, with M. Dostert and D. de Laat, (2020), submitted.

Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations, with C. Riener and H. Verdure, (2019), submitted.

Coloring the Voronoi tessellation of lattices, with M. Dutour Sikirić, D. Madore, and F. Vallentin, (2019), submitted.

On the Density of Sets Avoiding Parallelohedron Distance 1, with C. Bachoc, T. Bellitto, and A. Pêcher, Discrete & Computational Geometry, 62(3), (2019) 497–524.

On the Density of Cyclotomic Lattices Constructed from Codes, International Journal of Number Theory, Vol. 13, No. 5 (2017) 1261–1274

Geometric Distance Graphs, Lattices and Polytopes, Ph.D. thesis.

Upcoming talks

Point Distribution Webinar, online, August 2020: Exact semidefinite programming bounds for packing problems.
ANTS Summer School, online, June 2020: An introduction to euclidean lattices.
Online Summer School on Optimization, Interpolation and Modular Forms, EPFL, February 2020: Exact semidefinite programming bounds for packing problems.

Past talks

Séminaire Mathématiques Discrètes, Codes et Cryptographie, Paris, April 2020: Lattices, codes, and sphere packings.
Séminaire de Calcul Formel, Limoges, March 2020: Exact semidefinite programming bounds for packing problems.
Séminaire POLSYS, Paris, February 2020: Exact semidefinite programming bounds for packing problems.
Mørketidens MatteMøte, Tromsø, January 2020: Exact semidefinite programming bounds for packing problems.
Optimization Seminar, Erlangen, December 2019: Exact semidefinite programming bounds for packing problems.
Summer School Sphere Packings and Optimal Configurations , Kopp, October 2019: Lattices with exponentially large kissing numbers (after Serge Vlăduţ).
SIAM AG, Bern, July 2019: Computing spectral bounds for geometric graphs via polynomial optimization.
Groups, Arithmetic & Algebraic Geometry Seminar at EPFL, Lausanne, July 2019: Exact semidefinite programming bounds for packing problems.
Optimization Seminar, Cologne, December 2018: On Sets Avoiding Polytope Distance 1.
Algebra Seminar, Tromsø, October 2018: Lattices and Sphere Packings from Low to High Dimensions
ISMP 2018, Bordeaux, June 2018: The upper density of sets avoiding norm one in the real space of dimension n.
Discrete Mathematics Seminar, Delaware, May 2018: On sets avoiding distance 1.
Computational Challenges in the Theory of Lattices, Providence, May 2018: On the density of sets avoiding parallelohedron distance 1.
ICERM Graduate Students and PostDocs Seminar, Providence, February 2018: On sets avoiding distance 1.
LFANT Seminar, Bordeaux, January 2018: On the density of sets avoiding parallelohedron distance 1.
Journées Arithmétiques, Caen, July 2017: On the density of sets avoiding parallelohedron distance 1.
Lambda Seminar, Bordeaux, April 2017: À propos des ensembles évitant la distance 1.
GT Graphes et Optimisation, Bordeaux, March 2017: On the density of sets avoiding parallelohedron distance 1.
Network Coding and Designs, Dubrovnik, April 2016: On the Density of Cyclotomic Lattices Constructed from Codes.
Oberwolfach workshop Lattices and Applications in Number Theory, Oberwolfach, January 2016: On the Density of Cyclotomic Lattices Constructed from Codes.
Journées Codage et Cryptographie, la Londe-les-Maures, October 2015: Sur la Densité de Réseaux Obtenus par Construction A sur des Corps Cyclotomiques.
Scientific evaluation of the cluster CPU, Bordeaux, September 2015: Sur l’Utilisation des Réseaux Euclidiens pour la Transmission d’Information.

Teaching

2019-2020

Algebra 2, full responsability, Master of Mathematics and Statistics, Tromsø.

2017-2018

Information Theory, exercise sessions, first year Master students, Master "Cryptologie & Sécurité Informatique".
Linear Algebra for Engineering Sciences, lectures and exercise sessions, second year Bachelor students.

2016-2017

Linear Algebra for Engineering Sciences, lectures and exercise sessions, second year Bachelor students.
Linear Algebra, exercise sessions, first year Bachelor students.

2015-2016

Linear Algebra for Engineering Sciences, lectures and exercise sessions, second year Bachelor students.
Mathematics for Environment Sciences (Analysis and Algebra), lectures and exercise sessions, first year Bachelor students.

Other

Popularization

Animation of popularization activities in Tromsø (Forskningsdagene, skolelaboratoriet) about various topics, like Rubik's cube, Black Jack...
Member of the association Maths à Modeler, whose aim is popularization of mathematics, in particular for pupils in middle school (2015-2017).

Administration

Member of the department council, Tromsø (2020).
Vice-president of Lambda, the Bordeaux association of Ph.D in mathematics (2016-2018).