Termine

The Prym varieties introduced by Mumford in the 70's opened new perspectives in the study of the moduli space of abelian varieties: Prym varieties are abelian varieties arising from covers between curves. They generalize Jacobians and provide a larger class of abelian varieties which can be understood in terms of 1-dimensional geometric objects. For instance, it is known that the general principally polarized abelian variety of dimension less than or equal to 5 is the Prym variety of some unramified double cover. The Prym map between the moduli space of covers and the moduli space of abelian varieties assigns to each covering its Prym variety. In this talk I will discuss the geometry of the fibres of the Prym map for double covers in low genera, the global injectivity of the Prym map for ramified double covers, as well as the most recent results on the general injectivity of the Prym map for cyclic covers.

We design, analyze, and implement a randomized Greedy algorithm that builds certified reduced order models for parametric partial differential equations (PDEs). We show how drawing sample parameters from a clever probability distribution provides certification with high probability over not just the samples, but the entire parameter set, a powerful result that holds even for classes of nonlinear PDEs. Moreover, we demonstrate favorable properties of the algorithm?s sampling complexity to break the curse of dimensionality encountered by e.g. the deterministic Greedy algorithm when choosing a suitable training set. We present preliminary numerical results and discuss the remaining questions in algorithm analysis and implementation. Finally, we discuss the potential of the algorithm to construct localized reduced models for nonlinear multiscale PDEs in a fully local fashion, without relying on simulations of the global computational domain.

Further information

Further information

Further information