# Scientific

## Living the Good Life at a Liberal Arts College

## Landing an Industry Position

## About Irreversibility in Rarefied Gas Dynamics

## Making Mathematics with needle and thread: Quilts as Mathematical Objects

## Paths of minimal lengths on the set of exact differential k–forms

We initiate the study of optimal transportation of exact differential k–forms and introduce various distances as minimal actions. Our study involves dual maximization problems with constraints on the codifferential of k–forms. When k < n, only some directional derivatives of a vector field are controlled. This is in contrast with prior studies of optimal transportation of volume forms (k = n), where the full gradient of a scalar function is controlled. Furthermore, our study involves paths of bounded variations on the set of k–currents. This talk is based a joint work with B. Dacorogna and O. Kneuss.

For more information, see the event webpage.

## On the local Langlands conjectures

### Abstract

The Langlands program, initiated in the 1960s, is a set of conjectures predicting a unification of number theory and the representation theory of groups. More precisely, the Langlands correspondence provides a way to interpret results in number theory in terms of group theory, and vice versa.

In this talk we sketch a few aspects of the local Langlands correspondence using elementary examples. We then comment on some questions raised by the emerging "mod p" Langlands program.

### Biography

Professor Ollivier works in the Langlands Programme, a central theme in pure mathematics which predicts deep connections between number theory and representation theory. She has made profound contributions in the new branches of the "p-adic" and "mod-p" Langlands correspondence that emerged from Fontaine's work on studying the p-adic Galois representation, and is one of the pioneers shaping this new field. The first results on the mod-p Langlands correspondence were limited to the group GL2(Qp); but Dr. Ollivier has proved that this is the only group for which this holds, a surprising result which has motivated much subsequent research.

She has also made important and technically challenging contributions in the area of representation theory of p-adic groups, in particular, in the study of the Iwahori-Hecke algebra. In joint work with P. Schneider, Professor Ollivier used methods of Bruhat-Tits theory to make substantial progress in understanding these algebras. She has obtained deep results of algebraic nature, recently defining a new invariant that may shed light on the special properties of the group GL2(Qp).

Rachel Ollivier received her PhD from University Paris Diderot (Paris 7), and then held a research position at ENS Paris. She subsequently was an assistant professor at the University of Versailles and then Columbia University, before joining the UBC Department of Mathematics in 2013.

Rachel is the recepient of the 2015 UBC Mathematics and Pacific Institute for the Mathematical Sciences Faculty Award.

More information on this event is available on the event webpage

.## PDE Aspects of Fluid Flows

## The Arakelov Class Group

## Sparsity, Complexity and Practicality in Symbolic Computation

Modern symbolic computation systems provide an expressive language for describing mathematical objects. For example, we can easily enter equations such as

into a computer algebra system. However, to determine the factorization

with traditional methods would incur huge expression swell and high complexity. Indeed, many problems related to this one are provably intractable under various reasonable assumptions, or are suspected to be so. Nonetheless, recent work has yielded exciting new algorithms for computing with sparse mathematical expressions. In this talk, we will attempt to navigate this hazardous computational terrain of sparse algebraic computation. We will discuss new algorithms for sparse polynomial root finding and functional decomposition. We will also look at the "inverse" problem of interpolating or reconstructing sparse mathematical functions from a small number of sample points. Computations over both traditional" exact and symbolic domains, such as the integers and finite fields, as well as approximate (floating point) data, will be considered.