Past Events

Disjunctive programming is a classical technique for 0-1optimization in which a set of vertices of the hypercube is approximated by the convex hull of (carefully selected) polyhedra. Through the work of Lovasz, Schriver, Sherali and Adams, and others...

Recent experimental observations have revealed that during the onset of autoimmune Type 1 Diabetes (T1D), different clones of T cells with various T cell avidities and protein specificities are naturally generated in diabetic animal models. One...

The University of Victoria is providing opportunities for local First Nations school students (grades 1-12) to engage in hands-on Science, Technology, Engineering and Math activities. This is achieved through the collaborative efforts of the...

In this talk we present two stability results. Firstly we present a stability result for graphical, rotationally symmetric, translating solutions to mean curvature flow. There we obtain that for initial data that converge spatially at infinity to...

Calcium is a ubiquitous signaling molecule involved in the regulation of a wide range of processes. In cardiac cells, calcium plays a key role in mediating the electrical-excitation and contraction processes. Three mathematical models of calcium...

Primitive Feynman graphs in Phi^4 theory give rise to transcendental numbers which, from the work of people like David Broadhurst, are multiple zeta values in known examples. Very little is known in general. Even how to predict the weight of the zeta...

The study of certain error terms arising in number theory can lead to very interesting results. For example, it was a great surprise when Littlewood discovered in 1914 that pi(x)-Li(x) changes sign infinitely often. Since then, finer questions have...

An orientable manifold is called amphicheiral if it admits an orientation-reversing self-map and chiral if it does not. Many familiar manifolds like spheres or orientable surfaces are amphicheiral but chiral manifolds have also been known for many...

We look at the problem of recovering a graph from its chromatic symmetric function. For any graph we show that some basic data can be recovered, and for special cases of trees and unicyclic graphs we can recover the graph completely.