In this paper we improve the construction of Goto (1993) to obtain the Main Theorem: Let n, m and k be arbitrary integers such that 0 < m < n -1 3 1 and m < k < min{2m, n -1). Then there exists a point set Xk,, in Euclidean n-space IR" such that (i) pdimX& = m and dimXk,, = k, (ii) pdim(X& n H) = m
Embedding a set of rational points in lower dimensions
โ Scribed by Hiroshi Maehara
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 437 KB
- Volume
- 192
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Let X" be a set of rational points lying on an n-dimensional flat in a Euclidean space. We prove that for n 22, X" is congruent to a set of rational points in R2"+', and that for n >3, X" is similar to a set of rational points in RZn-'.
๐ SIMILAR VOLUMES
We present an efficient O n + 1/ฮต 4 5 -time algorithm for computing a 1 + ฮต)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ฮต 3 . We give some experimental results with implementations of various variants of
A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any