The View-Obstruction Problem forn-Dimensional Cubes

✍ Scribed by Yong-Gao Chen; T.W Cusick

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 95 KB
• Volume: 74
• Category: Article
• ISSN: 0022-314X
• DOI: 10.1006/jnth.1998.2309

✦ Synopsis

The view-obstruction problem for the n-dimensional cube is equivalent to the conjecture that for any n positive integers v 1 , ..., v n there is a real number x such that each &v i x& (n+1) &1 (here &y& denotes the distance from y to the nearest integer). This conjecture has been previously solved for n 4. In this paper we prove that when 2n&3 is a prime and n 4 we can find a real number x which gives each &v i x& 1Â(2n&3). In fact more than this is proved.