Cardinalities of k-distance sets in Minkowski spaces

Discrete Mathematics

Volumn 197-198, Issue , 1999, Pages 759-767

  Swanepoel, K J ^a  

^a UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

Equilateral set; Erdos distance problem; Few distance set; k distance set; Minkowski space

Indexed keywords

EID: 18344411247     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(99)90143-7     Document Type: Article

References (25)

1. E. Bannai, E. Bannai, An upper bound for the cardinality of an s-distance subset in real Euclidean space, Combinatorica 1 (1981) 99-102.
2. E. Bannai, E. Bannai, D. Stanton, An upper bound for the cardinality of an s-distance subset in real Euclidean space II, Combinatorica 3 (1983) 147-152.
3. J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdos in combinatorial geometry, Combinatorica 3 (1983) 281-297.
4. A. Blokhuis, Few-distance sets, CWI Tract 7, Stichting Mathematisch Centrum, Amsterdam, 1984.
5. A. Blokhuis, A new upper bound for the cardinality of 2-distance sets in Euclidean space, Ann. Discrete Math. 20 (1984) 65-66.
6. ∞-metric, Discrete Comput. Geom. 7 (1992) 433-434.
7. P. Brass, On equilateral simplices in normed spaces, To be published in Beiträge Algebra Geom., 1998.
8. Yu.D. Burago, V.A. Zalgaller, Geometric inequalities, Springer-Verlag, Heidelberg, 1988.
9. F. Chung, The number of different distances determined by n points in the plane, J. Combpn. Theory, Ser. A 36 (1984) 342-354.
10. F. Chung, E. Szemerédi, W. Trotter Jr., The number of distinct distances determined by a set of points in the Euclidean plane, Discrete Comput. Geom. 7 (1992) 1-11.
11. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete Comput. Geom. 5 (1990) 99-160.
12. H.T. Croft, K.J. Falconer, R.K. Guy, Unsolved Problems in Geometry, Springer-Verlag, New York, 1991.
13. P. Erdos, On sets of distances of n points, Amer. Math. Monthly 53 (1946) 248-250.
14. P. Erdos, On sets of distances of n points in Euclidean space, Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 165-169.
15. M. Golomb, Advanced problems and solutions. Isosceles n-points, Amer. Math. Monthly 55 (1948) 513-514.
16. H. Groemer, Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren, Monatsh. Math. 65 (1961) 74-81.
17. R.K. Guy, R.B. Kusner, An olla-podrida of open problems, often oddly posed, Amer. Math. Monthly 90 (1983) 196-199.
18. H. Harborth, L. Piepmeyer, Three distinct distances in the plane, Geom. Dedicata 61 (1996) 315-327.
19. L.M. Kelly, Elementary problems and solutions. Isosceles n-points, Amer. Math. Monthly 54 (1947) 227-229.
20. G.R. Lawlor, F. Morgan, Paired calibrations applied to soap films, immiscible fluids, and surfaces and networks minimizing other norms, Pacific J. Math. 166 (1994) 55-82.
21. F. Morgan, Minimal surfaces, crystals, networks, and undergraduate research, Math. Intelligencer 14 (1992) 37-44.
22. J. Pach, P.K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
23. C.M. Petty, Equilateral sets in Minkowski spaces, Proc. Amer. Math. Soc. 29 (1971) 369-374.
24. L.A. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combin. Probab. Comput. 6 (1997) 353-358.
25. A.C. Thompson, Minkowski Geometry, Encyclopedia of Mathematics and its Applications, Vol. 63, Cambridge University Press, Cambridge, 1996.