New maximal two-distance sets

Journal of Combinatorial Theory. Series A

Volumn 77, Issue 2, 1997, Pages 318-338

  Lisoněk, Petr ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031073047     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1997.2749     Document Type: Article

References (19)

1. 1. E. Bannai, E. Bannai, and D. Stanton, An upper bound for the cardinality of an s-distance subset in real Euclidean space, II, Combinatorica 3 (1983), 147-152.
2. 2. E. Bannai, On extremal finite sets in the sphere and other metric spaces, in "Proceedings of the Conference 'Algebraic, Extremal and Metric Combinatorics' (Montreal, 1986)," pp. 13-38, London Math. Soc. Lecture Note Ser., Vol. 131, Cambridge Univ. Press, Cambridge, New York, 1988.
3. 3. A. Blokhuis, A new upper bound for the cardinality of 2-distance sets in Euclidean space, Ann. Discrete Math. 20 (1984), 65-66.
4. 4. A. Blokhuis, "Few-Distance Sets," CWI Tract 7, CWI, Amsterdam, 1984.
5. p, q, in "Symposia Mathematica," Vol. 28, pp. 145-158, (Istituto Naz. di Alta Matematica Francesco Severi, Roma, 1986), Academic Press, New York, 1987.
6. 6. L. M. Blumenthal, "Theory and Applications of Distance Geometry," 2nd ed., Chelsea, New York, 1970.
7. 7. H. T. Croft, K. J. Falconer, and R. K. Guy, "Unsolved Problems in Geometry," Springer, New York, 1991.
8. 8. J. H. Davenport, Y. Siret, and E. Tournier, "Computer Algebra," Academic Press, New York, 1988.
9. 9. K. O. Geddes, S. R. Czapor, and G. Labahn, "Algorithms for Computer Algebra," Kluwer, Dordrecht/Norwell, MA, 1992.
10. 10. T. Granlund, "GNU MP. The GNU Multiple Precision Arithmetic Library," Free Software Foundation, Cambridge, MA, 1993.
11. 11. H. Harborth and L. Piepmeyer, Two-distance sets and the golden ratio, in "Applications of Fibonacci Numbers, Vol. 5" (G. E. Bergum et al., Eds.), pp. 279-288, Kluwer, Dordrecht/Norwell, MA, 1993.
12. 12. D. G. Larman, C. A. Rogers, and J. J. Seidel, On two-distance sets in Euclidean space, Bull. Lond. Math. Soc. 9 (1977), 261-267.
13. 13. B. D. McKay, "nauty User's Guide," Technical Report TR-CS-90-02, Australian National University, Department of Computer Science, 1990.
14. 14. S. M. Rump, Polynomial minimum root separation, Math. Comp. 33 (1979), 327-336.
15. 15. I. J. Schoenberg, Remarks to Maurice Fréchet's article, Ann. Math. 36 (1935), 724-732.
16. 16. J. J. Seidel, Discrete non-Euclidean geometry, in "Handbook of Incidence Geometry" (F. Buekenhout, Ed.), pp. 843-920, North-Holland/Elsevier, Amsterdam, 1995.
17. 17. J. J. Seidel, Geometric representations of graphs, Linear and Multilinear Algebra 39 (1995), 45-58.
18. 18. J. J. Seidel, The pentagon, in "Second International Conference on Combinatorial Mathematics" (A. Gewirtz and L. V. Quintas, Eds.), pp. 497-507, Ann. New York Acad. Sci., Vol. 319, New York Acad. Sci., New York, 1979.
19. 19. S. Warner, "Modern Algebra," Prentice-Hall, Englewood Cliffs, NJ, 1965.