No abstract uploaded!

It is shown that the punctual quotient scheme$Q$_{l}^{r}parametrizing all zero-dimensional quotients $$\mathcal{O}_{A^2 }^{ \oplus ^r } \to T$$ of length$l$and supported at some fixed point O∈$A$^{2}in the plane is irreducible.

We prove the Bershadsky-Cecotti-Ooguri-Vafa's conjecture for all genus Gromov-Witten potentials of the quintic threefolds, by identifying the Feynman graph sum with the $\nmsp$ stable graph sum via an R-matrix action. The Yamaguchi-Yau functional equations and the formulas of $F_1,F_2$, are direct consequences of the BCOV Feynman sum rule.

We prove that on any compact complex manifold one can find Gauduchon metrics with prescribed volume form. This is equivalent to prescribing the Chern–Ricci curvature of the metrics, and thus solves a conjecture of Gauduchon from 1984.

We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an mimes n rank mimes n matrix from mimes n number of linear measurements. The algorithms are first interpreted as iterative hard thresholding algorithms with subspace projections. Based on this connection, we show that provided the restricted isometry constant mimes n of the sensing operator is less than mimes n, the Riemannian gradient descent algorithm and a restarted variant of the Riemannian conjugate gradient algorithm are guaranteed to converge linearly to the underlying rank mimes n matrix if they are initialized by one step hard thresholding. Empirical evaluation shows that the algorithms are able to recover a low rank matrix from nearly the minimum number of measurements necessary.