Disproofs of Generalized Gilbert - Pollak Conjecture on the Steiner Ratio in Three or More Dimensions
暂无分享,去创建一个
The Gilbert?Pollak conjecture, posed in 1968, was the most important conjecture in the area of “Steiner trees.” The “Steiner minimal tree” (SMT) of a point setPis the shortest network of “wires” which will suffice to “electrically” interconnectP. The “minimum spanning tree” (MST) is the shortest such network when onlyintersite line segmentsare permitted. The generalized GP conjecture stated that?d=infP?Rd(lSMT(P)/lMST(P)) was achieved whenPwas the vertices of a regulard-simplex. It was showed previously that the conjecture is true ford=2 and false for 3?d?9. We settle remaining cases completely in this paper. Indeed, we show that any point set achieving?dmust have cardinality growing at least exponentially withd. The real question now is: What are the true minimal-?point sets? This paper introduces the “d-dimensional sausage” point sets, which may have a lit to do with the answer.
[1] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[2] R. Rankin. The Closest Packing of Spherical Caps in n Dimensions , 1955, Proceedings of the Glasgow Mathematical Association.
[3] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.
[4] Warren D. Smith. Studies in computational geometry motivated by mesh generation , 1989 .
[5] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.