Welcome to the Faculty of Mathematics community.

This community and it’s collections are organized using the University of Waterloo's Faculties and Academics structure. In this structure:

  • Communities are Faculties or Affiliated Institutions
  • Collections are Departments or Research Centres

Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).

New collections following this structure will be created UPON REQUEST .

Collections in this community

Recent deposits

  • exKidneyBERT: A Language Model for Kidney Transplant Pathology Reports and the Crucial Role of Extended Vocabularies 

    Yang, Tiancheng (University of Waterloo, 2022-09-30)
    Background: Pathology reports contain key information about the patient’s diagno- sis as well as important gross and microscopic findings. These information-rich clinical reports offer an invaluable resource for clinical ...
  • Modelling Allostery using a Computational Analysis of Side-Chain Interactions 

    Zhao, Leonard (University of Waterloo, 2022-09-30)
    Allostery refers to the regulation of protein activity arising from an effector molecule, such as a ligand, binding to a protein. The exact mechanisms that take place in allosteric regulation are still a source of debate ...
  • A Las Vegas Algorithm for the Ordered Majority Problem 

    Baral, Ben (University of Waterloo, 2022-09-29)
    In this thesis, we study the majority problem using ordered comparisons under the Las Vegas randomized algorithm model. The majority problem asks whether a given set of n elements, each with some colour, has a colour which ...
  • Studying and Leveraging API Usage Patterns 

    Venkatanarayanan, Sruthi (University of Waterloo, 2022-09-29)
    Software projects make use of libraries extensively. Libraries have intended API surfaces—sets of exposed library interfaces that library developers expect clients to use. However, in practice, clients only use small ...
  • Consensus Problems in Hybrid Multi-Agent Systems 

    Donganont, Mana (University of Waterloo, 2022-09-28)
    A multi-agent system (MAS) is a dynamic system that consists of a group of interacting agents distributed over a network. In the past decades, the study of distributed coordination of multi-agent systems has been widely ...
  • Designing a Unity Plugin to Predict Expected Affect in Games Using Biophilia 

    Zhang, Licheng (University of Waterloo, 2022-09-28)
    Video games can generate different emotional states and affective reactions, but it can sometimes be difficult for a game’s visual designer to predict the emotional response a player might experience when designing a game ...
  • Dash+: Extending Alloy with Replicated Processes for Modelling Transition Systems 

    Hossain, Tamjid (University of Waterloo, 2022-09-27)
    Modelling systems abstractly shows great promise to uncover bugs early in system development. The formal language Alloy provides the means of writing constraints abstractly but lacks explicit constructs for describing ...
  • On the power of interleaved low-depth quantum and classical circuits 

    Anand, Abhishek (University of Waterloo, 2022-09-26)
    Low-depth quantum circuits are a well-suited model for near-term quantum devices, given short coherence times and noisy gate operations, making it pivotal to examine their computational power. It was already known as early ...
  • Examination of Parametric Subharmonic Instability of K₁ Internal Tides Generated by Tidal Flow over a Ridge 

    Bernakevitch, Andrew (University of Waterloo, 2022-09-26)
    Internal gravity waves are thought to be a predominant source of mixing in the Earth's oceans. Here, we explore the interplay between two phenomena experienced by internal gravity waves - parametric subharmonic instability ...
  • Edge-disjoint Linkages in Infinite Graphs 

    Assem Abd-AlQader Mahmoud, Amena (University of Waterloo, 2022-09-26)
    The main subject of this thesis is the infinite graph version of the weak linkage conjecture by Thomassen [24]. We first prove results about the structure of the lifting graph; Theorems 2.2.8, 2.2.24, and 2.3.1. As an ...
  • Connectivity Properties of the Flip Graph After Forbidding Triangulation Edges 

    Bigdeli, Reza (University of Waterloo, 2022-09-23)
    The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is ...
  • Clique minors in dense matroids 

    Rivera Omana, Fernanda (University of Waterloo, 2022-09-23)
    The objective of this thesis is to bound the number of points a $U_{2,\ell+2}$- and $M(K_{k+1})$-minor-free matroid has. We first prove that a sufficiently large matroid will contain a structure called a tower. We then use ...
  • Theoretical Description of the Forces on a Point Charge Moving Parallel to a Supported Two-dimensional Material 

    Preciado Rivas, María Rosa (University of Waterloo, 2022-09-22)
    A charged particle, moving at a certain distance and parallel to a target, experiences a stopping force that slows it down and an image force that deflects it towards the target's surface. In this work, we aimed to describe ...
  • Turning Open Government Data Portals into Interactive Databases 

    Liu, Chang (University of Waterloo, 2022-09-21)
    The launch of open governmental data portals (OGDPs), such as data.gov, data.gov.in, and open.canada.ca, have popularized the open data movement of the last decade, which now includes numerous other portals from other ...
  • Transversal Problems In Sparse Graphs 

    Sun, Hao (University of Waterloo, 2022-09-20)
    Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ...
  • A Counterexample to a Conjecture About Trianle-Free Induced Subgraphs of Graphs with Large Chromatic Number 

    Carbonero, Alvaro; Hompe, Patrick; Moore, Benjamin; Spirkl, Sophie (Elsevier ScienceDirect, 2023-01)
    We prove that for every n, there is a graph G with χ(G) ≥ n and ω(G) ≤ 3 such that every induced subgraph H of G with ω(H) ≤ 2 satisfies χ(H) ≤ 4.This disproves a well-known conjecture. Our construction is a digraph with ...
  • Induced Subgraphs and Tree Decompositions III. Three-Path-Configurations and Logarithmic Treewidth. 

    Abrishami, Tara; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie (Advances in Combinatorics, 2022-09-09)
    A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family H of graphs, we say a graph G is H-free if no induced subgraph of G is ...
  • Empirical Game Theoretic Models for Autonomous Driving: Methods and Applications 

    Sarkar, Atrisha (University of Waterloo, 2022-09-16)
    In recent years, there has been enormous public interest in autonomous vehicles (AV), with more than 80 billion dollars invested in self-driving car technology. However, for the foreseeable future, self-driving cars will ...
  • KG-Pipeline: An Automated Knowledge Graph Generation Framework 

    Vezvaei, Alireza (University of Waterloo, 2022-09-16)
    Knowledge Graphs (KGs) have many applications, specifically in information retrieval and question answering. Community projects are conducted for building large-scale KGs with crowdsourcing, but building KGs with this ...
  • POEM: Pattern-Oriented Explanations of CNN Models 

    Dadvar, Vargha (University of Waterloo, 2022-09-16)
    While Convolutional Neural Networks (CNN) achieve state-of-the-art predictive performance in applications such as computer vision, their predictions are difficult to explain, similar to other types of deep learning models. ...

View more


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages