Mathematics

The Social Lives of Viruses

Speaker: 
Asher Leeks
Date: 
Wed, Apr 2, 2025
Location: 
PIMS, University of British Columbia
Zoom
Online
Conference: 
UBC Math Biology Seminar Series
Abstract: 

Viral infections are social processes. Viral replication requires shared gene products that can be used by multiple viral genomes within the same cell, and hence act as public goods. This gives rise to viral cheats, a type of molecular parasite formed by large deletions, that spread by exploiting public goods encoded by full-length viruses. Cheats exist across the viral universe, arise frequently in laboratory infections, and reflect the emergence of evolutionary conflict at the molecular level. In this talk, I will explore two evolutionary consequences of viral cheating that play out at different timescales. Firstly, we will consider the evolution of multipartite viruses, in which the genome is fragmented, and each fragment must separately infect a host. This genome structure comes with clear costs, but has nevertheless evolved multiple times, and today accounts for nearly 40% of known plant viral species. Previous explanations for the evolution of multipartitism have focused on group benefits, but typically require unrealistic rates of coinfection, especially for multipartite viruses with more than two segments. We will argue that cheating provides a contrasting explanation. By combining evolutionary game theory models with agent-based simulations, we will show that the invasion of mutually complementing viral cheats can drive the evolution of multipartitism under far more permissive conditions, including transitions to highly multipartite viruses. This framework shows that multipartitism need not be a group-level adaptation, but can instead emerge as the evolutionary endpoint of the tragedy of the commons. Secondly, we will consider the evolution of cheat-driven extinction in viruses. Cheats emerge spontaneously in laboratory infections of almost all known viruses, driving drastic reductions in viral population sizes. As a result, virologists have long argued that viral infections may be ‘self-limiting’, a claim supported by recent discoveries of cheats in natural viral infections. However, it is unclear whether viral infections provide enough time for viral cheats to emerge, spread, and drive cooperator extinction. Here, we present a birth-death model that incorporates mutation, demographic noise, and a frequency-dependent selective advantage to cheating. We identify qualitatively different dynamical regimes and the timescales under which they lead to viral extinction. We further show that our model can produce characteristic signatures of selection, opening the door to evolutionary biomarkers for predicting the outcome of viral infections from sequencing data. This approach argues that cheating may not only be relevant over long evolutionary timescales, but may also shape viral dynamics in clinically relevant ways, analogous to the emergence of cancer in multicellular organisms.

Class: 

Harnessing Mathematical Modeling and Epidemiological Data for Infectious Disease Surveillance and Public Health Decision Making

Speaker: 
Caroline Mburu
Date: 
Wed, Mar 26, 2025
Location: 
PIMS, University of British Columbia
Zoom
Online
Conference: 
UBC Math Biology Seminar Series
Abstract: 

Mathematical modeling, when combined with diverse epidemiological datasets, provides valuable insights for understanding and controlling infectious diseases. In this talk, I will present a series of case studies demonstrating how the synergy between modeling and serological, case-based, and wastewater surveillance data can enhance disease monitoring and inform public health strategies.

Serological data measures biomarkers of infection or vaccination, offering direct estimates of population immunity. This approach complements case data by providing a broader understanding of disease epidemiology. Wastewater surveillance, which detects pathogen genomes in sewage, captures infections across the entire population, including symptomatic, asymptomatic, and pre-/post-symptomatic individuals. This approach complements traditional case reporting by providing a broader, community-wide perspective on disease transmission.

In the first case study, I will discuss how we utilized serological data and a static cohort model to quantify the relative contributions of natural infection, routine vaccination, and supplementary immunization activities (SIAs) to measles seroconversion in Kenyan children. In the second case study we developed a simple static model combined with serological data to evaluate the effectiveness of SIAs in reducing the risk of a measles outbreak in the post-pandemic period. Finally, I will introduce my current work on wastewater-based epidemic modeling for mpox surveillance in British Columbia, demonstrating how wastewater and case data can be integrated within a dynamic transmission model to predict future scenarios of mpox outbreak.

These case studies illustrate the power of mathematical modeling in integrating multiple data sources to inform public health strategies and improve infectious disease control efforts.

Class: 

Zeros of L-functions in low-lying intervals and de Branges spaces

Speaker: 
Antonio Pedro Ramos
Date: 
Tue, Apr 1, 2025
Location: 
Online
Zoom
Abstract: 

We consider a variant of a problem first introduced by Hughes and Rudnick (2003) and generalized by Bernard (2015) concerning conditional bounds for small first zeros in a family of L-functions. Here we seek to estimate the size of the smallest intervals centered at a low-lying height for which we can guarantee the existence of a zero in a family of L-functions. This leads us to consider an extremal problem in analysis which we address by applying the framework of de Branges spaces, introduced in this context by Carneiro, Chirre, and Milinovich (2022).

Class: 

Elliptic curves, Drinfeld modules, and computations

Speaker: 
Antoine Leudière
Date: 
Thu, Mar 13, 2025
Location: 
PIMS, University of Calgary
Conference: 
UCalgary Algebra and Number Theory Seminar
Abstract: 

We will talk about Drinfeld modules, and how they compare to elliptic curves for algorithms and computations.

Drinfeld modules can be seen as function field analogues of elliptic curves. They were introduced in the 1970's by Vladimir Drinfeld, to create an explicit class field theory of function fields. They were instrumental to prove the Langlands program for GL2 of a function field, or the function field analogue of the Riemann hypothesis.

Elliptic curves, to the surprise of many theoretical number theorists, became a fundamental computational tool, especially in the context of cryptography (elliptic curve Diffie-Hellman, isogeny-based post-quantum cryptography) and computer algebra (ECM method).

Despite a rather abstract definition, Drinfeld modules offer a lot of computational advantages over elliptic curves: one can benefit from function field arithmetics, and from objects called Ore polynomials and Anderson motives.

We will use two examples to highlight the practicality of Drinfeld modules computations, and mention some applications.

Class: 

Two Inference Problems in Dynamical Systems from Mathematical and Computational Biology

Speaker: 
Wenjun Zhao
Date: 
Wed, Mar 26, 2025
Location: 
PIMS, University of British Columbia
Online
Zoom
Abstract: 

This talk will discuss two inference problems in dynamical systems, both motivated by applications in mathematical biology. First, we will discuss the classical gene regulatory network inference problem for time-stamped single-cell datasets and recent advances in optimal transport-based methods for this task. Second, if time permits, I will present an algorithm for bifurcation tracing, which aims to identify interfaces in parameter space. Applications to agent-based models and spatially extended reaction-diffusion equations will be demonstrated, both of which simulate Turing patterns commonly observed in animal skin, vegetation patterns, and more.

Class: 

Almost sure bounds for sums of random multiplicative functions

Speaker: 
Besfort Shala
Date: 
Tue, Mar 11, 2025
Location: 
Online
Zoom
Abstract: 

I will start with a survey on sums of random multiplicative functions, focusing on distributional questions and almost sure upper bounds and Ω-results. In this context, I will describe previous work with Jake Chinis on a central limit theorem for correlations of Rademacher multiplicative functions, as well as ongoing work on establishing almost sure sharp bounds for them.

Class: 

Number Theory versus Random Matrix Theory: the joint moments story

Speaker: 
Andrew Pearce-Crump
Date: 
Mon, Mar 10, 2025
Location: 
PIMS, University of Lethbridge
Online
Zoom
Conference: 
Lethbridge Number Theory and Combinatorics Seminar
Abstract: 

It has been known since the 80s, thanks to Conrey and Ghosh, that the average of the square of the Riemann zeta function, summed over the extreme points of zeta up to a height T, is 12(e25)logT as T. This problem and its generalisations are closely linked to evaluating asymptotics of joint moments of the zeta function and its derivatives, and for a time was one of the few cases in which Number Theory could do what Random Matrix Theory could not. RMT then managed to retake the lead in calculating these sorts of problems, but we may now tell the story of how Number Theory is fighting back, and in doing so, describe how to find a full asymptotic expansion for this problem, the first of its kind for any nontrivial joint moment of the Riemann zeta function. This is joint work with Chris Hughes and Solomon Lugmayer.

Class: 

Fourier optimization and the least quadratic non-residue

Speaker: 
Emily Quesada-Herrera
Date: 
Thu, Mar 6, 2025
Location: 
PIMS, University of Calgary
Conference: 
UCalgary Algebra and Number Theory Seminar
Abstract: 

We will explore how a Fourier optimization framework may be used to study two classical problems in number theory involving Dirichlet characters: The problem of estimating the least character non-residue; and the problem of estimating the least prime in an arithmetic progression. In particular, we show how this Fourier framework leads to subtle, but conceptually interesting, improvements on the best current asymptotic bounds under the Generalized Riemann Hypothesis, given by Lamzouri, Li, and Soundararajan. Based on joint work with Emanuel Carneiro, Micah Milinovich, and Antonio Ramos.

Class: 

Collective cell chirality

Speaker: 
Alex Mogilner
Date: 
Wed, Feb 26, 2025
Location: 
PIMS, University of British Columbia
Zoom
Online
Conference: 
UBC Math Biology Seminar Series
Abstract: 

Individual and collective cell polarity has fascinated mathematical modelers for a long time. Recently, a more subtle type of symmetry breaking started to attract attention of experimentalists and theorists alike - emergence of chirality in single cells and in cell groups. I will describe a joint project with Bershadsky/Tee lab to understand collective cell chirality on adhesive islands. From the initial microscopy data, two potential models emerged: in one, cells elongate and slowly rotate, and neighboring cells align with each other. When the collective rotation is stopped by the island boundaries, chirality emerges. In an alternative model, cells become chiral due to stress fibers turns inside the cells on the boundary, and then the polarity pattern propagates inward into the cellular groups. We used agent-based modeling to simulate these two hypotheses. The models make many predictions, and I will show how we discriminated between the models by comparing the data to these predictions.

Class: 

Refinements of Artin's primitive root conjecture

Speaker: 
Paul Peringuey
Date: 
Mon, Mar 3, 2025
Location: 
PIMS, University of Lethbridge
Online
Zoom
Conference: 
Lethbridge Number Theory and Combinatorics Seminar
Abstract: 

Let ordp(a) be the order of a in (Z/pZ). In 1927, Artin conjectured that the set of primes p for which an integer a1, is a primitive root (i.e. ordp(a)=p1) has a positive asymptotic density among all primes. In 1967 Hooley proved this conjecture assuming the Generalized Riemann Hypothesis (GRH). In this talk we will study the behaviour of ordp(a) as p varies over primes, in particular we will show, under GRH, that the set of primes p for which ordp(a) is “k prime factors away” from p1 has a positive asymptotic density among all primes except for particular values of a and k. We will interpret being “k prime factors away” in three different ways, namely k=ω(p1ordp(a)), k=Ω(p1ordp(a)) and k=ω(p1)ω(ordp(a)), and present conditional results analogous to Hooley's in all three cases and for all integer k. From this, we will derive conditionally the expectation for these quantities. Furthermore we will provide partial unconditional answers to some of these questions. This is joint work with Leo Goldmakher and Greg Martin.

Class: 

Pages