A Problem of Leo Moser About Repeated Distances on the Sphere
作者:
ErdösPaul,
HickersonDean,
PachJános,
期刊:
The American Mathematical Monthly
(Taylor Available online 1989)
卷期:
Volume 96,
issue 7
页码: 569-575
ISSN:0002-9890
年代: 1989
DOI:10.1080/00029890.1989.11972243
出版商: Taylor&Francis
数据来源: Taylor
摘要:
AbstractWe disprove a conjecture of Leo Moser by showing that (i) for every natural numbernand 0<α<2 there is a system ofnpoints on the unit sphereS2such that the number of pairs at distanceαfrom each other is at least const·nlog*n(where log* stands for the iterated logarithm function) (ii) for everynthere is a system ofnpoints onS2such that the number of pairs at distance√2 from each other is at least const -n4/3. We also construct a set ofnpoints in the plane in general position (no 3 on a line, no 4 on a circle) such that they determine fewer than const·nlog3/log2distinct distances, which settles a problem of Erdös.
点击下载:
PDF (638KB)
返 回