Browsing Mathematics (Faculty of) by Title
Now showing items 16741693 of 2745

The O'NanScott Theorem for Finite Primitive Permutation Groups, and Finite Representability
(University of Waterloo, 20090806)The O'NanScott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five ... 
Obediencebased MultiAgent Cooperation for Sequential Social Dilemmas
(University of Waterloo, 20200514)We propose a mechanism for achieving cooperation and communication in MultiAgent Reinforcement Learning (MARL) settings by intrinsically rewarding agents for obeying the commands of other agents. At every timestep, agents ... 
OFFDIAGONAL CORNERS OF SUBALGEBRAS OF L(Cn)
(Elsevier, 20201215)Let n ∈ N, and consider Cn equipped with the standard inner product. Let A ⊆ L(Cn) be a unital algebra and P ∈ L(Cn) be an orthogonal projection. The space L := P ⊥Aran P is said to be an offdiagonal corner of A, and L ... 
Offset Surface Light Fields
(University of Waterloo, 2003)For producing realistic images, reflection is an important visual effect. Reflections of the environment are important not only for highly reflective objects, such as mirrors, but also for more common objects such as ... 
On 2crossingcritical graphs with a V8minor
(University of Waterloo, 20140522)The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph $G$ is $k$crossingcritical if it has crossing number at least $k$, and any subgraph of $G$ has crossing ... 
On a 2class polling model with reneging and ki limited service
(Springer, 20180618)This paper analyzes a 2class, singleserver polling model operating under a kilimited service discipline with classdependent switchover times. Arrivals to each class are assumed to follow a Poisson process with phasetype ... 
On a general mixed priority queue with server discretion
(Taylor & Francis, 20161001)We consider a singleserver queueing system which attends to N priority classes that are classified into two distinct types: (i) urgent: classes which have preemptive resume priority over at least one lower priority class, ... 
On a Question of Wintner Concerning the Sequence of Integers Composed of Primes from a Given Set
(University of Waterloo, 20070927)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, 20140101)As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highlyavailable resources. To achieve this goal, recent proposals have advocated to offer ... 
On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture
(Elsevier, 20210501)For a digraph G and v is an element of V(G), let delta(+)(v) be the number of outneighbors of v in G. The CaccettaHaggkvist 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, 20070926)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, 20220727)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, 20161115)In the first part of the thesis, a decentralized wireless network of separate transmitterreceiver pairs is studied where there is no central controller to assign the resources to the users and users do not explicitly ... 
On Combinatorics, Integrability and Puzzles
(University of Waterloo, 20201023)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 Constant Factors in ComparisonBased Geometric Algorithms and Data Structures
(University of Waterloo, 20140911)Many standard problems in computational geometry have been solved asymptotically optimally as far as comparisonbased algorithms are concerned, but there has been little work focusing on improving the constant factors ... 
On Convolution Squares of Singular Measures
(University of Waterloo, 20100825)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 $\alpha1/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 HighRecall Retrieval Systems for Electronic Discovery
(University of Waterloo, 20170308)Highrecall 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, 20070830)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, 20070518)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 ...