Indexed metadata
Orthogonal Pairs in Maps from the Sphere to the Circle
Jonathan A. Noel
Source abstract
We prove that, for any and any , there exist orthogonal vectors such that the length of the shortest arc between and is at most . This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.