Department of Mathematics

Creative Services Photography

Department of Mathematics

Study how to use math and computation to model science, engineering, social and biomedical problems, and learn the secrets of symmetry, form, number and shape.

SFU's Mathematics Department specializes in using a combination of today's computational tools and profound theory in leading-edge studies and critical application areas. Math students go on to careers as great problem solvers in business, computing, data and the sciences. Join us!

Undergraduate Studies

Award-winning faculty and a wealth of golden research opportunities make SFU one of the best places to study mathematics in Canada.

Learn More

Graduate Studies

Hone your math problem-solving skills and gather the contacts you need to kickstart your career in tech, medicine, communication, economics or engineering.

Learn More

Research

SFU is home to world-class math research. We harness the power of collaboration to drive invaluable contributions to a variety of areas within mathematics

Learn More

Quick Links:

Faculty Interviews

New Assistant Faculty Member Interviews:

Dr Ben Ashby 
Dr Nadish de Silva
Dr Katrina Honigs
Dr Jake Levinson
Dr Ailene MacPherson
Dr Jessica Stockdale

Found HERE!

Dr Caroline Colijn

Canada 150 Research Chair in Mathematics of Infection, Evolution and Public Health

Found Here!

News

See More

Department Calendar

<
April 2025
>
S
M
T
W
T
F
S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
  • 7
    Mon
    • 5:15 pm – 7:15 pm (UTC)
      PhD Thesis Proposal - Mahdi Salehzadeh

      PhD Thesis Proposal - Mahdi Salehzadeh

      Monday, April 7, 5:15 pm – 7:15 pm (UTC)
      Title
      Models of Life History Events Timing: Epidemiological, Eco-Evolutionary, and Stochastic Dynamics
      Supervisor
      Ailene MacPherson
      Committee
      John Stockie & Jessica Stockdale
      Location
      K9509
      The timing of events plays a crucial role in understanding population dynamics and in developing realistic and informative predictions in fields such as epidemiology, ecology, and evolutionary biology. This thesis explores how different forms of event timing arise from biological processes that govern epidemiological, ecological, and evolutionary biology dynamics. The first project (chapter 3) examines how and to what extent delay-induced threshold impacts tree-killing bark beetle epidemic dynamics. The second project (chapter 4) addresses eco-evolutionary questions regarding highly variable and synchronized reproductive events, specifically exploring the selective pressures that influence discrete life histories such as seed masting. Finally, the third project (chapter 5) evaluates the fixation probability of seed-masting mutation in plants considering the effects of demographic and evolutionary stochasticity. Together, these studies establish a comprehensive theoretical framework for understanding event timing-driven dynamics in epidemiological, ecological, and evolutionary systems.
  • 24
    Thu
    • 4:00 pm – 6:00 pm (UTC)
      PhD Thesis Proposal - Shivaramakrishna Pragada

      PhD Thesis Proposal - Shivaramakrishna Pragada

      Thursday, April 24, 4:00 pm – 6:00 pm (UTC)
      Title
      Graph Eigenvalues and Irreducible Graphs
      Supervisor
      Bojan Mohar & Ladislav Stacho
      Committee
      Matthew Devos
      Location
      K9509
      For a fixed graph H, determining the maximum number of edges in an H-free graph is a central problem in extremal graph theory. Tuŕan’s theorem for Kr-free graphs is a classic result in this area. Later, spectral generalizations of Tuŕan’s Theorem were proposed and proved. Bollobás and Nikiforov (2007) conjectured that for any Kr+1-free graph G with two largest eigenvalues λ1 and λ2 of its adjacency matrix, we have λ21+ λ22≤ 2|E(G)|􀀀1 − 1r. We investigate this conjecture and its generalizations. The positive (negative) p-energy is the sum of p-th powers of positive (negative) eigenvalues of graph G. Recently, interesting connections have been established between the p-energy of graphs and its chromatic number. We propose and answer several questions concerning p-energy. A graph is said to be irreducible if the characteristic polynomial of its adjacency matrix is irreducible is over rational numbers. It is an old conjecture to show that characteristic polynomials of almost all graphs are irreducible are over Q. We study this and related questions.

PhD Thesis Proposal - Shivaramakrishna Pragada

Thursday, April 24, 4:00 pm – 6:00 pm (UTC)
Title
Graph Eigenvalues and Irreducible Graphs
Supervisor
Bojan Mohar & Ladislav Stacho
Committee
Matthew Devos
Location
K9509
For a fixed graph H, determining the maximum number of edges in an H-free graph is a central problem in extremal graph theory. Tuŕan’s theorem for Kr-free graphs is a classic result in this area. Later, spectral generalizations of Tuŕan’s Theorem were proposed and proved. Bollobás and Nikiforov (2007) conjectured that for any Kr+1-free graph G with two largest eigenvalues λ1 and λ2 of its adjacency matrix, we have λ21+ λ22≤ 2|E(G)|􀀀1 − 1r. We investigate this conjecture and its generalizations. The positive (negative) p-energy is the sum of p-th powers of positive (negative) eigenvalues of graph G. Recently, interesting connections have been established between the p-energy of graphs and its chromatic number. We propose and answer several questions concerning p-energy. A graph is said to be irreducible if the characteristic polynomial of its adjacency matrix is irreducible is over rational numbers. It is an old conjecture to show that characteristic polynomials of almost all graphs are irreducible are over Q. We study this and related questions.
Department of Mathematics
Search
close