Browsing Combinatorics and Optimization by Title
Now showing items 429-434 of 434
-
Variational Spectral Analysis
(University of Waterloo, 2000)We present results on smooth and nonsmooth variational properties of {it symmetric} functions of the eigenvalues of a real symmetric matrix argument, as well as {it absolutely symmetric} functions of the singular values ... -
Variations on a Theme: Graph Homomorphisms
(University of Waterloo, 2013-08-30)This thesis investigates three areas of the theory of graph homomorphisms: cores of graphs, the homomorphism order, and quantum homomorphisms. A core of a graph X is a vertex minimal subgraph to which X admits a ... -
Vertex Stabilizers for Network Bargaining Games
(University of Waterloo, 2022-03-04)Network bargaining games form a prominent class of examples of game theory problems defined on graphs, where vertices represent players, and edges represent their possible interactions. An instance of a \emph{network ... -
A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function
(The Electronic Journal of Combinatorics, 2021-04-09)This paper has two main parts. First, we consider the Tutte symmetric function XB, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version ofXB, show that this function admits a ... -
Welch Bounds and Quantum State Tomography
(University of Waterloo, 2008-12-22)In this thesis we investigate complete systems of MUBs and SIC-POVMs. These are highly symmetric sets of vectors in Hilbert space, interesting because of their applications in quantum tomography, quantum cryptography and ... -
Worst-Case to Average-Case Reductions for the SIS Problem: Tightness and Security
(University of Waterloo, 2019-07-30)We present a framework for evaluating the concrete security assurances of cryptographic constructions given by the worst-case SIVP_γ to average-case SIS_{n,m,q,β} reductions. As part of this analysis, we present the tightness ...