Author:
Ang D. D.,Daykin D. E.,Sheng T. K.
Abstract
A polygon is said to be rational if all its sides and diagonals are rational, and I. J. Schoenberg has posed the difficult question, ‘Can any given polygon be approximated as closely as we like by a rational polygon?’ Many of the known results concerning this question are contained as special cases in theorem 1 below which was proved by one of us (cf. the references).
Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Diophantine Equations;Unsolved Problems in Number Theory;2004
2. Integral Drawings of the Complete Graph K6;Topics in Combinatorics and Graph Theory;1990
3. Some Diophantine Equations;Unsolved Problems in Number Theory;1981
4. Some Unsolved Problems in Plane Geometry;Mathematics Magazine;1979-05
5. Polytopes, graphs, and complexes;Bulletin of the American Mathematical Society;1970