Gauss invented Gaussian quadrature following an approach entirely different from the one we now find in textbooks. I will describe leisurely the contents of Gauss's original memoir on quadrature, an impressive piece of mathematics, based on continued fractions, Padé approximation, generating functions, the hypergeometric series and more.

The talk will describe accelerated algorithms for computing full or partial matrix factorizations such as the eigenvalue decomposition, the QR factorization, etc. The key technical novelty is the use of  randomized projections to reduce the effective dimensionality of  intermediate steps in the computation. The resulting algorithms execute faster on modern hardware than traditional algorithms, and are particularly well suited for processing very large data sets.

The algorithms described are supported by a rigorous mathematical analysis that exploits recent work in random matrix theory. The talk will briefly review some representative theoretical results.

Abstract: We study nonuniform sampling in shift-invariant spaces whose generator is a totally positive function. For a subclass of such generators the sampling theorems can be formulated in analogy to the theorems of Beurling and Landau for bandlimited functions. These results are  optimal and validate  the  heuristic reasonings in the engineering literature. In contrast to the cardinal series, the reconstruction procedures for sampling in a shift-invariant space with a totally positive generator  are local and thus accessible to numerical linear algebra.

A subtle  connection between sampling in shift-invariant spaces and the theory of Gabor frames leads to new and optimal  results for Gabor frames.  We show that the set of phase-space shifts of  $g$ (totally positive with a Gaussian part) with respect to a rectangular lattice forms a frame, if and only if the density of the lattice  is strictly larger than 1. This solves an open problem going backto Daubechies in 1990 for the class of totally positive functions of Gaussian type.
 

Almost all real-world applications involve a degree of uncertainty. This may be the result of noisy measurements, restrictions on observability, or simply unforeseen events. Since many models in both engineering and the natural sciences make use of partial differential equations (PDEs), it is natural to consider PDEs with random inputs. In this context, passing from modelling and simulation to optimization or control results in stochastic PDE-constrained optimization problems. This leads to a number of theoretical, algorithmic, and numerical challenges.

 From a mathematical standpoint, the solution of the underlying PDE is a random field, which in turn makes the quantity of interest or the objective function an implicitly defined random variable. In order to minimize this distributed objective, one can use, e.g., stochastic order constraints, a distributionally robust approach, or risk measures. In this talk, we will make use of risk measures.

After motivating the approach via a model for the mitigation of an airborne pollutant, we build up an analytical framework and introduce some useful risk measures. This allows us to prove the existence of solutions and derive optimality conditions. We then present several approximation schemes for handling non-smooth risk measures in order to leverage existing numerical methods from PDE-constrained optimization. Finally, we discuss solutions techniques and illustrate our results with numerical examples.

What makes an intersection likely or unlikely? A simple dimension count shows that two varieties of dimension r and s are non "likely" to intersect if r < codim s, unless there are some special geometrical relations among them. A series of conjectures due to Bombieri-Masser-Zannier, Zilber and Pink rely on this philosophy. I will speak about a joint work with F. Barroero (Basel) in this framework in the special case of a curve in a family of elliptic curves. The proof is based on Pila-Zannier method, combining diophantine ingredients with a refinement of a theorem of Pila and Wilkie about counting rational points in sets definable in o-minimal structures.
   Everyone welcome!
 

In this talk, I discuss the positive geometry of the Wilson Loop Diagrams appearing in SYM N-4 theory. In particular, I define an algorithm for associating Wilson Loop diagrams to convex cells of the positive Grassmannians. Using combinatorics of these cells, I then consider the geometry of N^2MHV diagrams on 6 points.

We study vortex sheets for the relativistic Euler equations in three-dimensional Minkowski spacetime. The problem is a nonlinear hyperbolic problem with a characteristic free boundary. The so-called Lopatinskii condition holds only in a weak sense, which yields losses of derivatives. A necessary condition for the weak stability is obtained by analyzing roots of the Lopatinskii determinant associated to the linearized problem. Under such stability condition,  we prove short-time existence and nonlinear stability of relativistic vortex sheets by the Nash-Moser iterative scheme.