IMPACTHIV and SFU Health Sciences

Wed 24 Feb 2016, 12:00pm
PIMS Seminars and PDF Colloquiums
UBC Robson Square

PIMS Vancouver Lunchbox Lecture: Systems Modeling for HIV Health Service Delivery

UBC Robson Square
Wed 24 Feb 2016, 12:00pm1:00pm
Abstract
Public health program managers and policy makers are regularly faced with complex decisions that affect the health and wellbeing of the public. Mathematical models and operations research tools can be used to consider diverse interacting factors, such as the epidemiology and clinical aspects of a condition, delivery methods of health services, and constraints on budget and resources. Creating reliable, datadriven models that are tractable and useful for informing policy decisions requires close collaboration of stakeholders and mathematicians.
This presentation will describe a health systems modeling project to inform the delivery of HIV health services in Vancouver, which illustrates the promise, challenges and rewards of crosssector collaborations and offers possible avenues for the expanded use of modeling in public policy.
Registration is free and a light lunch will be provided. For more details and to register for this event, please visit http://www.pims.math.ca/industrialevent/160224pllkv .
hide

Princeton University

Fri 26 Feb 2016, 3:00pm
SPECIAL
Department Colloquium / PIMS Seminars and PDF Colloquiums
ESB 2012

Coloring some perfect graphs PIMS/UBC Distinguished Colloquium

ESB 2012
Fri 26 Feb 2016, 3:00pm4:00pm
Abstract
Perfect graphs are a class of graphs that behave particularly well with respect to coloring. In the 1960's Claude Berge made two conjectures about this class of graphs, that motivated a great deal of
research, and by now they have both been solved.
The following remained open however: design a combinatorial algorithm that produces an optimal coloring of a perfect graph. Recently, we were able to make progress on this question, and we will discuss it in this talk. Last year, in joint work with Lo, Maffray, Trotignon and Vuskovic we were able to construct such an algorithm under the additional assumption that the input graph is squarefree (contains no induced fourcycle). More recently, together with Lagoutte, Seymour and Spirkl, we solved another case of the problem, when the clique number of the input graph is fixed (and not part of the input).
hide

Harvard University

Fri 18 Mar 2016, 3:00pm
SPECIAL
Department Colloquium / PIMS Seminars and PDF Colloquiums
ESB2012

PIMSUBC Distinguished ColloquiumThe Siegel Mass Formula, Tamagawa Numbers, and Nonabelian Poincare Duality

ESB2012
Fri 18 Mar 2016, 3:00pm4:00pm
Abstract
Let L be a positive definite lattice. There are only finitely many positive definite lattices L' which are isomorphic to L modulo N for every N > 0: in fact, there is a formula for the number of such lattices, called the Siegel mass formula. In this talk, I'll review the Siegel mass formula and explain how it was reformulated by Weil as a statement about volumes of adelic groups. I'll then describe some joint work with Dennis Gaitsgory on computing these volumes over function fields using ideas from topology: in particular, a nonabelian version of Poincare duality.
hide

Seminar Information Pages

Note for Attendees
About the PIMS Lunchbox Series