The trigonometric interpolants to a periodic function f in equispaced points converge if f is Dini-continuous, and the associated quadrature formula, the trapezoidal rule, converges if f is continuous.  What if the points are perturbed?  Amazingly little has been done on this problem, or on its algebraic (i.e. nonperiodic) analogue.  I will present new results joint with Anthony Austin which show some surprises.

Let G be a split reductive group over a finite extension k of Q_p. Reeder and Yu have given a new construction of supercuspidal representations of G(k) using geometric invariant theory. Their construction is uniform for all p but requires as input stable vectors in certain representations coming from Moy-Prasad filtrations. In joint work, Jessica Fintzen and I have classified the representations of this kind which contain stable vectors; as a corollary, the construction of Reeder-Yu gives new representations when p is small. In my talk, I will give an overview of this work, as well as explicit examples for the case when G = G_2. For these examples, I will explicitly describe the locus of all stable vectors, as well as the Langlands parameters which correspond under the local Langlands correspondence to the representations of G(k). 

During the last decade, the progress in the computational performance of commercial mixed-integer programming solvers have been significant. Part of this success is due to faster computers and better software engineering but a more significant part of it is due to the power of the cutting planes used in these solvers.
In the first part of this talk, we will discuss main components of a MIP solver and describe some classical families of valid inequalities (Gomory mixed integer cuts, mixed integer rounding cuts, split cuts, etc.) that are routinely used in these solvers. In the second part, we will discuss recent progress in cutting plane theory that has not yet made its way to commercial solvers. In particular, we will discuss cuts from lattice-free convex sets and answer a long standing question in the affirmative by deriving a finite cutting plane algorithm for mixed-integer programming.

We will present a very general framework for unconstrained stochastic optimization which is based on standard trust region framework using  random models. In particular this framework retains the desirable features such step acceptance criterion, trust region adjustment and ability to utilize of second order models. We make assumptions on the stochasticity that are different from the typical assumptions of stochastic and simulation-based optimization. In particular we assume that our models and function values satisfy some good quality conditions with some probability fixed, but can be arbitrarily bad otherwise. We will analyze the convergence and convergence rates of this general framework and discuss the requirement on the models and function values. We will will contrast our results with existing results from stochastic approximation literature. We will finish with examples of applications arising the area of machine learning. 
 

Abstract: Triangulations of surfaces serve as important examples for cluster theory, with the natural operation of “diagonal flips” encoding mutation in cluster algebras and categories. In this talk we will focus on the combinatorics of mutation on marked surfaces with infinitely many marked points, which have gained importance recently with the rising interest in cluster algebras and categories of infinite rank. In this setting, it is no longer possible to reach any triangulation from any other triangulation in finitely many steps. We introduce the notion of mutation along infinite admissible sequences and show that this induces a preorder on the set of triangulations of a fixed infinitely marked surface. Finally, in the example of the completed infinity-gon we define transfinite mutations and show that any triangulation of the completed infinity-gon can be reached from any other of its triangulations via a transfinite mutation. The content of this talk is joint work with Karin Baur.

Categorification of knot polynomials -- Daniele Celoria

Classically, the most powerful and versatile knot invariants take the form of polynomials. These can usually be defined by simple recursive equations, known as skein relations; after giving the main examples of polynomial knot invariants (Alexander and Jones polynomials), we are going to informally introduce categorifications. Finally we are going to present the Knot Floer and the Khovanov homologies, and show that they provide a categorification of the aforementioned polynomial knot invariants.

Network science for online social media: an x-ray or a stethoscope for society -- Mariano Beguerisse

The abundance of data from social media outlets such as Twitter provides the opportunity to perform research at a societal level at a scale unforeseen. This has spurred the development of mathematical and computational methods such as network science, which uses the formalism and language of graph theory to study large systems of interacting agents. In this talk, I will provide a sketch of network science and its application to study online social media. A number of different networks can be constructed from Twitter data, which can be used to ask questions about users, ranging from the structural (an 'x-ray' to see how societies are connected online) to the topical ('stethoscope' to feel how users interact in the context of specific event). I will provide concrete examples from the UK riots of 2011, applications to medical anthropology, and political referenda, and will also highlight distinct challenges such as the directionality of connections, the size of the network, the use of temporal information and text, all of which are active areas of research.