In practice, L-functions appear as generating functions encapsulating information about various objects, such as Galois representations, elliptic curves, arithmetic functions, modular forms, Maass forms, etc. Studying L-functions is therefore of utmost importance in number theory at large. Two of their attached data carry critical information: their zeros, which govern the distributional behavior of underlying objects; and their central values, which are related to invariants such as the class number of a field extension. We discuss a connection between low-lying zeros and central values of L-functions, in particular showing that results about the distribution of low-lying zeros (towards the density conjecture of Katz-Sarnak) implies results about the distribution of the central values (towards the normal distribution conjecture of Keating-Snaith). Even though we discuss this principle in general, we instanciate it in the case of modular forms in the level aspect to give a statement and explain the arguments of the proof.
Let ord𝑝(𝑎)be the order of 𝑎in (ℤ/𝑝ℤ)∗. In 1927, Artin conjectured that the set of primes 𝑝for which an integer 𝑎≠−1,◻is a primitive root (i.e. ord𝑝(𝑎)=𝑝−1) 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 ord𝑝(𝑎)as 𝑝varies over primes. In particular, we will show, under GRH, that the set of primes 𝑝for which ord𝑝(𝑎)is “𝑘prime factors away” from 𝑝−1− 1 has a positive asymptotic density among all primes, except for particular values of 𝑎and 𝑘. We will interpret being “𝑘prime factors away” in three different ways:
𝑘=𝜔(𝑝−1ord𝑝(𝑎)),𝑘=Ω(𝑝−1ord𝑝(𝑎)),𝑘=𝜔(𝑝−1)−𝜔(ord𝑝(𝑎)).
We will present conditional results analogous to Hooley’s in all three cases and for all integer 𝑘. 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.
Over the years, there have been several open problems involving polynomials that I would love to tell others about. This opportunity to speak at my “home ground” seems the perfect time to do so. More specifically, I will discuss the following:
- A conjecture of Ruzsa for integers and a related problem in a joint work with Bell for polynomials over finite fields.
- A conjectural lower bound for the degree of irreducible factors of certain polynomials from a joint work with DeMarco, Ghioca, Krieger, Tucker, and Ye.
- The irreducibility of certain Gleason polynomials.
Cell movement requires long-range coordination of the cytoskeletal machinery that organizes cell morphogenesis. We have found that reciprocal interactions between biochemical signals and physical forces enable this long-range signal integration. Through a combination of optogenetic inputs, mechanical measurements, and mathematical modeling, we resolve a recent controversy regarding the role of membrane tension propagation in this process and reveal the requirements for long-range transmission of tension in cells. Most cells don't move in isolation-- they collectively migrate by sharing information similar to the flocking of birds, the schooling of fish, and the swarming of ants. We reveal a novel active signal relay system that rapidly and robustly ensures the proper level of immune cell recruitment to sites of injury and infection.
The quadratically regularized optimal transport problem (QOT) has emerged in the literature as a sparse alternative to entropic regularization (EOT). Unlike EOT, whose solutions always have full support—even for small regularization parameters—QOT solutions, or QOT plans, tend to approximate the support of the unregularized transport problem. This raises natural questions: Do the supports decrease monotonically? At what rate does this support reduction occur? How quickly does the QOT cost converge to the optimal transport cost? In this talk, we will review recent theoretical results addressing these questions.
Bounds on the logarithmic derivative and the reciprocal of the Riemann zeta function are studied as they have a wide range of applications, such as computing bounds for Mertens function. In this talk, we are mainly concerned with explicit bounds. Obtaining decent bounds are tricky, as they are only valid in a zero-free region, and the constants involved tend to blow up as one approaches the edge of the region, and a potential zero. We will discuss such bounds, their uses, and the computational and analytic techniques involved. Finally, we also show how to obtain a power savings in the case of the reciprocal of zeta.
A fundamental aim of evolutionary biology is to describe and explain biodiversity patterns; this aim centers around questions of how many "species" exist, where they are most/least abundant, how this distribution is changing over time, and why. Practically speaking, deciphering biodiversity trends and understanding their underlying ecological and evolutionary drivers is important for monitoring and managing both the biodiversity crisis and emergent epidemics. In this seminar I will discuss 100 years of biodiversity mathematics, beginning with Yule's 1924 foundational work on the model that now bears his name. Despite the twists and turns of the intervening years, I will then introduce recent work in my group with direct connections to Yule's. Throughout, I will highlight the importance of using math and models to clarify biological thinking and will argue that a fully interdisciplinary approach that integrates math, biology, and statistics is necessary to understand biodiversity, be it at the macroevolutionary or epidemiological scale.
Lethbridge Number Theory and Combinatorics Seminar
Abstract:
A directed variant of the famous Oberwolfach problem, the directed Oberwolfach problem considers the following scenario. Given $n$ people seated at $t$ round tables of size $m_1,m_2,\ldots,m_t$, respectively, such that $m_1+m_2+\cdots +m_t=n$, does there exist a set of $n−1$ seating arrangements such that each person is seated to the right of every other person precisely once? I will first demonstrate how this problem can be formulated as a type of graph-theoretic problem known as a cycle decomposition problem. Then, I will discuss a particular style of construction that was first introduced by R. HÄggkvist in 1985 to solve several cases of the original Oberwolfach problem. Lastly, I will show how this approach can be adapted to the directed Oberwolfach problem, thereby allowing us to obtain solutions for previously open cases. Results discussed in this talk arose from collaborations with Andrea Burgess, Peter Danziger, and Daniel Horsley.
The Moran process models the evolutionary dynamics between two competing types in a population, traditionally assuming a fixed population size. We investigate an extension to this process which adds ecological aspects through variable population sizes. For the original Moran process, birth and death events are correlated to maintain a constant population size. Here we decouple the two events and derive the stochastic differential equation that represents the dynamics in a well-mixed population and captures its behaviour as the population size becomes arbitrarily large. Our analysis explores the impact of this decoupling on two key determinants of the evolutionary process: fixation probabilities and fixation times. In evolutionary graph theory, these statistics depend significantly on the population structure, such that structures have been identified that act as ‘amplifiers’ of selection while others are ‘suppressors’ of selection. However, these features are crucially dependent on the sequence of events, such as birth-death vs death-birth – a seemingly small change with significant consequences. In our extension of the Moran process this distinction is no longer necessary or possible. We determine the fixation probabilities and times for the well-mixed population, regular graphs as well as amplifiers and suppressors, and compare them to the original Moran process.