Browsing Mathematics (Faculty of) by Title
Now showing items 1492-1511 of 3027
-
Light-Matter Interaction Models in Relativistic Quantum Information
(University of Waterloo, 2021-05-21)In this thesis, we study the interaction of a first-quantized atomic system with the quantum electromagnetic field within the context of relativistic quantum information (RQI). To that end, we examine common classes of ... -
LightPlay: An Ambient Light System for Video Game Indicators and Notifications
(University of Waterloo, 2020-08-11)Video games often have indicators and notifications to convey in-game information. However, displaying these visuals on-screen come with trade-offs, such as consuming screen real estate and an inability for them to be ... -
Likelihood-based Density Estimation using Deep Architectures
(University of Waterloo, 2019-12-20)Multivariate density estimation is a central problem in unsupervised machine learning that has been studied immensely in both statistics and machine learning. Several methods have thus been proposed for density estimation ... -
The Limited Effectiveness of Neural Networks for Simple Question Answering on Knowledge Graphs
(University of Waterloo, 2017-12-08)Simple factoid question answering (QA) is a task, where the questions can be answered by looking up a single fact in the knowledge base (KB). However, this QA task is difficult, since retrieving a single supporting fact ... -
Limiting techniques for the discontinuous Galerkin method on unstructured meshes
(University of Waterloo, 2022-08-18)Many complex phenomena like shock-shock interactions, shock-vortex interactions, stratified flows, etc., are governed by nonlinear hyperbolic conservation laws. Higher order numerical schemes like the discontinuous Galerkin ... -
A Linear Algebraic Method on the Chromatic Symmetric Function
(University of Waterloo, 2023-08-28)The Stanley-Stembridge conjecture is a longstanding conjecture that has evaded proof for nearly 30 years. Concerned with the e-basis expansions of the chromatic symmetric functions of unit-interval graphs, this conjecture ... -
Linear and Non-linear Monotone Methods for Valuing Financial Options Under Two-Factor, Jump-Diffusion Models
(University of Waterloo, 2007-10-01)The evolution of the price of two financial assets may be modeled by correlated geometric Brownian motion with additional, independent, finite activity jumps. Similarly, the evolution of the price of one financial asset ... -
Linear Approximations For Factored Markov Decision Processes
(University of Waterloo, 2004)A Markov Decision Process (MDP) is a model employed to describe problems in which a decision must be made at each one of several stages, while receiving feedback from the environment. This type of model has been extensively ... -
Linear preservers of polynomial numerical hulls of matrices
(Elsevier, 2019-08-15)Let Mn be the algebra of all n × n complex matrices, 1 ≤ k ≤ n − 1 be an integer, and φ : Mn −→ Mn be a linear operator. In this paper, it is shown that φ preserves the polynomial numerical hull of order k if and only if ... -
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization
(University of Waterloo, 2010-01-05)We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is central: given a graph ... -
Linearization Methods in Time Series Analysis
(University of Waterloo, 2011-09-30)In this dissertation, we propose a set of computationally efficient methods based on approximating/representing nonlinear processes by linear ones, so-called linearization. Firstly, a linearization method is introduced for ... -
Linearized Stability of Partial Differential Equations with Application to Stabilization of the Kuramoto--Sivashinsky Equation
(Society for Industrial and Applied Mathematics, 2018-01-05)Linearization is a useful tool for analyzing the stability of nonlinear differential equations. Unfortunately, the proof of the validity of this approach for ordinary differential equations does not generalize to all ... -
Linearizing Contextual Multi-Armed Bandit Problems with Latent Dynamics
(University of Waterloo, 2022-02-10)In many real-world applications of multi-armed bandit problems, both rewards and observed contexts are often influenced by confounding latent variables which evolve stochastically over time. While the observed contexts and ... -
Linearly-dense classes of matroids with bounded branch-width
(University of Waterloo, 2017-09-27)Let $M$ be a non-empty minor-closed class of matroids with bounded branch-width that does not contain arbitrarily large simple rank-$2$ matroids. For each non-negative integer $n$ we denote by $ex(n)$ the size of the ... -
The Linkage Problem for Group-labelled Graphs
(University of Waterloo, 2009-09-24)This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled ... -
Linking Alloy with SMT-based Finite Model Finding
(University of Waterloo, 2021-01-28)Alloy is a well-known declarative language for modelling systems early in the development process. Currently, it uses the Kodkod library as its back-end for finite model finding (finding instances of the model by determining ... -
List 3-Coloring Graphs with No Induced P6+rP3
(Springer Nature, 2021-01-01)For an integer t, we let Pt denote the t-vertex path. We write H+G for the disjoint union of two graphs H and G, and for an integer r and a graph H, we write rH for the disjoint union of r copies of H. We say that a graph ... -
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
(Elsevier, 2020-11)Let s and t be positive integers. We use Pt to denote the path with t vertices and K1,s to denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision of K1,s is obtained by replacing ... -
List Coloring Some Classes of 1-Planar Graphs
(University of Waterloo, 2021-12-23)In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its ... -
List colouring hypergraphs and extremal results for acyclic graphs
(University of Waterloo, 2008-05-21)We study several extremal problems in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of hypergraphs. We discuss two methods for determining the ...