Multiplicative preprojective algebras (MPAs) were originally defined by Crawley-Boevey and Shaw to encode solutions of the Deligne-Simpson problem as irreducible representations. 
MPAs have recently appeared in the literature from different perspectives including Fukaya categories of plumbed cotangent bundles (Etgü and Lekili) and, similarly, microlocal sheaves 
on rational curves (Bezrukavnikov and Kapronov.) After some motivation, I'll suggest a purely algebraic approach to study these algebras. Namely, I'll outline a proof that MPAs are 
2-Calabi-Yau if Q contains a cycle and an inductive argument to reduce to the case of the cycle itself.

When S is a finite set of natural numbers, a GCD-sum is a particular kind of double-sum over the elements of S, and they arise naturally in several settings. In particular, these sums play a role when one studies the local statistics of point sequences on the unit circle. There are known upper bounds for the size of a GCD-sum in terms of the size of the set S, most recently due to de la Bretèche and Tenenbaum, and these bounds are sharp. Yet the known examples of sets S for which the GCD-sum over S provides a matching lower bound all possess strong multiplicative structure, whereas in applications the set S often comes with additive structure. In this talk I will describe recent joint work with Thomas Bloom in which we apply an estimate from sum-product theory to prove a much stronger upper bound on a GCD-sum over an additively structured set. I will also describe an application of this improvement to the study of the distribution of points on the unit circle, with a further application to arbitrary infinite subsets of squares. 

 I will give a short survey on classical inequalities for Laplace eigenvalues, tell about related history and questions. I will then discuss the so-called Korevaar method, and new results generalising to higher eigenvalues a number of classical inequalities known for the first Laplace eigenvalue only.