Research Associate,
My most frequent collaborator Laura Mančinska's website.
Contact
email: <first name><middle initial><last name>@gmail.com
address: University College London
Faculty of Engineering Science
Department of Computer Science
66 Gower Street, London WC1E 6BT
Research Interests
My research primarily focuses on graph theory, in particular homomorphisms. This includes the study of cores, chromatic number and variants such as the Lovász theta number, the homomorphism order of graphs, and unique vector colorings. I also have an interest in some aspects of quantum information such as nonlocal games and zero-error communication. I have combined these interests through the introduction and study of quantum homomorphisms.
Education
2009 – 2013
Ph.D. in Mathematics
University of Waterloo
Advisor: Chris Godsil
2007 – 2008
Master of Mathematics
University of Waterloo
Advisor: Chris Godsil
2003 – 2007
B.S. in Mathematics
North Carolina State University
Work in Progress - Universal completability, least eigenvalue frameworks, and vector colorings. Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, and Antonios Varvitsiotis.
- Vector Colorings and Graph Homomorphisms. Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, and Antonios Varvitsiotis.
- Vector Colorings of Categorical Products. Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, and Antonios Varvitsiotis.
- Homomorphisms of Strongly Regular Graphs. David E. Roberson.
- Relaxations of Graph Isomorphism. Laura Mančinska, David E. Roberson, and Antonios Varvitsiotis.
Preprints - Deciding the existence of perfect entangled strategies for nonlocal games. Laura Mančinska, David E. Roberson, and Antonios Varvitsiotis. Submitted to the Chicago Journal of Theoretical Computer Science, 2015. arXiv:1506.07429
- Fractional Zero Forcing via Three-color Forcing Games. Leslie Hogben, Kevin F. Palmowski, David E. Roberson, and Michael Young. Submitted to Discrete Applied Mathematics, 2015.
- Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions. Leslie Hogben, Kevin F. Palmowski, David E. Roberson, and Simone Severini. Submitted to the Electronic Journal of Linear Algebra, 2015. arXiv:1502.00016
- Conic Formulations of Graph Homomorphisms. David E. Roberson. Submitted to the Journal of Algebraic Combinatorics, 2014. arXiv:1411.6723
Publications
- Quantum Homomorphisms. Laura Mančinska and David E. Roberson. Accepted to Journal of Combinatorial Theory, Series B. Presented as a highlighted talk at the 9th Conference on the Theory of Quantum Computation and Cryptography, 2015. arXiv:1212.1724
- Sabidussi versus Hedetniemi for Three Variations of Chromatic Number. Chris Godsil, David E. Roberson, Robert Šámal, Simone Severini. Combinatorica, 2015. arXiv:1305.5545
- Two Characterizations of Nonlocal Games with Perfect Maximally Entangled Strategies. Laura Mančinska, David E. Roberson, and Antonios Varvitsiotis. Proceedings of the 14th Asian Quantum Information Science Conference, 2014.
- Bounds on Entanglement Assisted Source-Channel Coding via the Lovasz Theta Number and its Variants. Toby Cubitt, Laura Mančinska, David E. Roberson, Simone Severini, Dan Stahlke, and Andreas Winter. IEEE Transactions on Information Theory, 60(11):7330–7344, 2014. arXiv:1310.7120
- Cores of Vertex Transitive Graphs. David E. Roberson. The Electronic Journal of Combinatorics, 20(2):P45, 2013. arXiv:1302.4470
- Häggkvist-Hell Graphs: A Class of Kneser-colorable Graphs. David E. Roberson. Discrete Mathematics, 312(5):837–853, 2012. arXiv:1008.2199
Notes
Here are some short notes I have written for myself and/or others. They may contain errors and typos and be missing references or complete explanations. - Parameter Collapse - This note is primarily about comparing three graph parameters: the Lovasz theta function, a variant of theta recently defined by Laurent and Piovesan, and the projective packing number (defined in my PhD thesis). For a fixed graph the values of these parameters are monotonically nonincreasing with respect to their order in the list above. Interestingly, we show that if the first two parameters are equal on a given graph, then they are all equal.
- Quantum Correlations and the Completely Positive Semidefinite Cone - Here we show a correspondence between the set of two-party quantum correlations and the completely positive semidefinite cone, recently defined by Laurent and Piovesan. In particular, we show that if the completely positive semidefinite cone is closed, then so is the set of two-party quantum correlations.
|
|
