1.3k citations
- Perimeter InstituteCA92 papers
- Durham UniversityGB22 papers
- Stanford UniversityUS17 papers
- Harvard UniversityUS15 papers
- Massachusetts Institute of TechnologyUS15 papers
- University of British ColumbiaCA15 papers
- California Institute of TechnologyUS14 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- McMaster UniversityCA14 papers
- University of TorontoCA13 papers
- Canadian Institute for Advanced ResearchCA11 papers
- Space Telescope Science InstituteUS11 papers
87 papers · 1 filter
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3
This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…
The hierarchy of multiple many-body interaction scales in high-temperature superconductors
W. Meevasana, X. J. Zhou, S. Sahrakorpi +28
To date, angle-resolved photoemission spectroscopy has been successful in identifying energy scales of the many-body interactions in correlated materials, focused on binding energi…
A photon loss tolerant Zeno CSIGN gate
Casey R. Myers, Alexei Gilchrist
We model an optical implementation of a CSIGN gate that makes use of the Quantum Zeno effect [1,2] in the presence of photon loss. The raw operation of the gate is severely affecte…
Specific Heat of the Dilute Ising Magnet LiHoYF
J. A. Quilliam, C. G. A. Mugford, A. Gomez +2
We present specific heat data on three samples of the dilute Ising magnet $\HoYLF$ with , 0.045 and 0.080. Previous measurements of the ac susceptibility of an $x = 0.04…
Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization
Yichuan Ding, Nathan Krislock, Jiawei Qian +1
We study Semidefinite Programming, \SDPc relaxations for Sensor Network Localization, \SNLc with anchors and with noisy distance information. The main point of the paper is to view…
Fourier analysis and large independent sets in powers of complete graphs
Mahya Ghandehari, Hamed Hatami
For constant and arbitrary , it was known that in the graph any independent set of size close to the maximum is close to some independent set of maximum size. We pro…