- Graduate
- Undergraduate
- Department
- Research
- News & Events
- K-12
- About

close

# Discrete Mathematics

## Our Research

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include Structural Graph Theory, matroids, enumeration, bioinformatics, ancestral genomics, digital communications, and Coding Theory.

### Join us for our weekly Discrete Math Seminar every Tuesday from 1:30 - 2:30 in SC K9509

### News: We will be hosting 2 events in 2019 - CanaDAM 2019 and Fq14.

Click on the event names for more info!

## People

### Faculty

- Tom Brown Ramsey Theory

- Cedric Chauve Computational Genomics and Paleogenomics
- Matt Devos Graph Theory
- Luis Goddyn Graph Theory
- Jonathan Jedwab Sequence and Array Correlations, Digital Communications, Quantum Information Theory
- Petr Lisonek Cryptography, Coding theory, Quantum information theory
- Jan Manuch Computational Biology and Bioinformatics
- Marni Mishna Analytic and Enumerative Combinatorics
- Bojan Mohar Graph Theory
- Ladislav Stacho Graph Theory
- Tamon Stephen Combinatorial Optimization
- Lily Yen Combinatorial Enumeration

### Postdoctoral Fellows & Visitors

### PhD Students

- Reza Dastbasteh
- Sebastian Gonzalez
- Kevin Halasz
- Mahdieh Malekian
- Masood Masjoody
- Abhinav Shantanam
- Samuel Simon
- Nathan Singer
- Amelie Trotignon

### MSc Students

- Brandon Elford

### Recent Theses

**2018**

Degree | Student Name | Thesis Title | Supervisor |
---|---|---|---|

PhD | Seyyed Hosseini | Game of Cops and Robbers on Eulerian DigraphsB | Bojan Mohar |

**2017**

Degree | Student Name | Thesis Title | Supervisor |
---|---|---|---|

PhD | Ross Churchley | Odd Disjoint Trails and Totally Odd Graph Immersions | Bojan Mohar |

MSc | Benjamin Moore | Rooted Graph Minors and Reducibility of Graph Polynomials | Karen Yeats |

PhD | Iain Crump | Graph Invariants with Connections to the Feynman Period in φ^{4} Theory |
Karen Yeats |

MSc | Olga Zasenko | Algorithms for Colourful Simplicial Depth and Median in the Plane | Tamon Stephen |

MSc | Tara Petrie | The Combinatorial RNA Design Problem for Binary Trees | Jonathan Jedwab |

MSc | Stefan Trandafir | Magic Eulerian Hypergraphs | Petr Lisonek |

MSc | Kevin Halasz | Coloring Cayley Tables of Finite Groups | Luis Goddyn |

MSc | Samuel Simon | Linking Systems of Difference Sets | Jonathan Jedwab |

MSc | Adam Dyck | The Realisability of γ-graphs | Jonathan Jedwab |

MSc (Project) | France Paquet-Nadeau | On the Maximum Size of Condensed Sequences Neighbourhoods under the Levenshtein distance | Cedric Chauve |

**2016**

Degree | Student Name | Thesis Title | Supervisor |
---|---|---|---|

PhD | Justin Chan | Three Problems Involving Permutations | Jonathan Jedwab |

MSc | Akbar Rafiey | Algorithmic Aspects of some Vertex Ordering Problems | Ladislav Stacho |

MSc | Lucien Lapierre | Vectorial Bent Functions in Characteristic Two | Petr Lisonek |

2015 and Older - Click HERE

### Resources

#### Upcoming Events

- The 7th Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019) 28 - 31 May 2019

- The 14th International Conference on Finite Fields and their Applications (Fq14) 3-7 June 2019
- Foundations of Computational Mathematics (FoCM 2020) June 2020

#### Past Events

- Combinatorial Structures in Perturbative Quantum Field Theory
- FPSAC (Formal Power Series and Algebraic Combinatorics)
- Journées Combinatoires Franco-Vancouvéroises
- 2018 Pacific Northwest Combinatorics Day
- March 31 2018 Pacific Northwest Combinatorics Day
- Connections in Discrete Mathematics 2015

- SAC 2013 (Selected Areas in Cryptography)

- RECOMB 2011 (Conference on Research in Computational Molecular Biology)

F T I