Video Lectures

What is the symplectic analogue of being convex? We shall present different ideas to approach this question. Along the way, we shall present recent joint results with J.Dardennes and J.Zhang on monotone toric domains non-symplectomorphic to convex...

Linear equations in smooth numbers

Lilian Matthiesen

A number is called y-smooth if all of its prime factors are bounded above by y. The set of y-smooth numbers below x forms a sparse subset of the integers below x as soon as x is sufficiently large in terms of y. If f_1, …, f_r \in Z[x_1,…,x_s] is a...