Browsing Mathematics (Faculty of) by Title
Now showing items 1858-1877 of 3004
-
On a Question of Wintner Concerning the Sequence of Integers Composed of Primes from a Given Set
(University of Waterloo, 2007-09-27)We answer to a Wintner's question concerning the sequence of integers composed of primes from a given set. The results generalize and develop the answer to Wintner’s question due to Tijdeman. -
On Achieving High Survivability in Virtualized Data Centers
(Institute of Electronics, Information and Communication Engineers, 2014-01-01)As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highly-available resources. To achieve this goal, recent proposals have advocated to offer ... -
On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture
(Elsevier, 2021-05-01)For a digraph G and v is an element of V(G), let delta(+)(v) be the number of out-neighbors of v in G. The Caccetta-Haggkvist conjecture states that for all k >= 1, if G is a digraph with n = |V(G)| such that delta(+)(v) ... -
On Algorithms, Separability and Cellular Automata in Quantum Computing
(University of Waterloo, 2007-09-26)In Part I of this thesis, we present a new model of quantum cellular automata (QCA) based on local unitary operations. We will describe a set of desirable properties for any QCA model, and show that all of these properties ... -
On Amenability Properties and Coideals of Quantum Groups
(University of Waterloo, 2022-07-27)We study amenability type properties of locally compact quantum groups and subobjects of quantum groups realized as submodules of their von Neumann algebras. An important class of such subobjects are the coideals, which ... -
On Asynchronous Interference Channels
(University of Waterloo, 2016-11-15)In the first part of the thesis, a decentralized wireless network of separate transmitter-receiver pairs is studied where there is no central controller to assign the resources to the users and users do not explicitly ... -
On coloring digraphs with forbidden induced subgraphs
(University of Waterloo, 2023-04-25)This thesis mainly focuses on the structural properties of digraphs with high dichromatic number. The dichromatic number of a digraph $D$, denoted by $\dichi(D)$, is designed to be the directed analog of the chromatic ... -
On Combinatorics, Integrability and Puzzles
(University of Waterloo, 2020-10-23)In the last decade, many old and new results in combinatorics have been shown using the theory of quantum integrable systems from particle physics. The key to solving such problems is the derivation of an underlying ... -
On Computable Online Learning
(University of Waterloo, 2023-04-27)We initiate a study of computable online (c-online) learning, which we analyze under varying requirements for "optimality" in terms of the mistake bound. Our main contribution is to give a necessary and sufficient condition ... -
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
(University of Waterloo, 2014-09-11)Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has been little work focusing on improving the constant factors ... -
On Convolution Squares of Singular Measures
(University of Waterloo, 2010-08-25)We prove that if $1 > \alpha > 1/2$, then there exists a probability measure $\mu$ such that the Hausdorff dimension of its support is $\alpha$ and $\mu*\mu$ is a Lipschitz function of class $\alpha-1/2$. -
On Decoupling Concurrency Control from Recovery in Database Repositories
(University of Waterloo, 2005)We report on initial research on the concurrency control issue of compiled database applications. Such applications have a repository style of architecture in which a collection of software modules operate on a common ... -
On Design and Evaluation of High-Recall Retrieval Systems for Electronic Discovery
(University of Waterloo, 2017-03-08)High-recall retrieval is an information retrieval task model where the goal is to identify, for human consumption, all, or as many as practicable, documents relevant to a particular information need. This thesis ... -
On Diagonal Acts of Monoids
(University of Waterloo, 2007-08-30)In this paper we discuss what is known so far about diagonal acts of monoids. The first results that will be discussed comprise an overview of some work done on determining whether or not the diagonal act can be finitely ... -
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
(University of Waterloo, 2007-05-18)Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound ... -
On Enumerative Structures in Quantum Field Theory
(University of Waterloo, 2020-07-13)This thesis addresses a number of enumerative problems that arise in the context of quantum field theory and in the process of renormalization. In particular, the enumeration of rooted connected chord diagrams is further ... -
On estimands arising from misspecified semiparametric rate-based analysis of recurrent episodic conditions
(Wiley, 2019-11-10)Marginal rate-based analyses are widely used for the analysis of recurrent events in clinical trials. In many areas of application, the events are not instantaneous but rather signal the onset of a symptomatic episode ... -
On Eulerian orientations of even-degree hypercubes
(Elsevier, 2018-09-01)It is well known that every Eulerian orientation of an Eulerian 2k-edge connected (undirected) graph is strongly k-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, ... -
On Excluded Minors for Even Cut Matroids
(University of Waterloo, 2007-01-22)In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are ... -
On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree
(University of Waterloo, 2021-12-23)We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of size ∆(G) − 17. Our proof closely parallels a proof from Cranston and Rabern, who showed that graphs with χ = ∆ and ∆ ≥ ...