Tue, 10 Feb 2015

17:00 - 18:00
C2

Spin projective representations of Weyl groups, Green polynomials, and nilpotent orbits

Dan Ciubotaru
(Oxford)
Abstract

The classification of irreducible representations of pin double covers of Weyl groups was initiated by Schur (1911) for the symmetric group and was completed for the other groups by A. Morris, Read and others about 40 years ago. Recently, a new relation between these projective representations, graded Springer representations, and the geometry of the nilpotent cone has emerged. I will explain these connections and the relation with a Dirac operator for (extended) graded affine Hecke algebras.  The talk is partly based on joint work with Xuhua He.

From Lawvere to Brandenburger–Keisler: Interactive forms of diagonalization and self-reference
Abramsky, S Zvesper, J Journal of Computer and System Sciences volume 81 issue 5 799-812 (Aug 2015)
Towards scaling up Markov chain Monte Carlo: An adaptive subsampling approach
Bardenet, R Doucet, A Holmes, C 31st International Conference on Machine Learning, ICML 2014 volume 1 630-653 (01 Jan 2014)
Fast computation of Wasserstein barycenters
Cuturi, M Doucet, A 31st International Conference on Machine Learning, ICML 2014 volume 3 2146-2154 (21 Jun 2014)
Real-time dynamics in the one-dimensional Hubbard model
Seabra, L Essler, F Pollmann, F Schneider, I Veness, T Physical Review B volume 90 issue 24 245127 (01 Dec 2014)
Thu, 29 Jan 2015

14:00 - 15:00
L5

High-order approximations for some classical Gaussian quadrature

Dr Ignace Bogaert
(University of Ghent)
Abstract

Gaussian quadrature rules are of theoretical and practical interest because of their role in numerical integration and interpolation. For general weighting functions, their computation can be performed with the Golub-Welsch algorithm or one of its refinements. However, for the specific case of Gauss-Legendre quadrature, computation methods based on asymptotic series representations of the Legendre polynomials have recently been proposed. 
For large quadrature rules, these methods provide superior accuracy and speed at the cost of generality. We provide an overview of the progress that was made with these asymptotic methods, focusing on the ideas and asymptotic formulas that led to them. 
Finally, the limited generality will be discussed with Gauss-Jacobi quadrature rules as a prominent possibility for extension.

Subscribe to