1,314,758 research outputs found
On Density of Ratio Sets of Powers of Primes
Denote by R+ and N the set of all positive real numbers and the natural numbers,respectively. Let P = {p1, . . . , pn, . . . } be the set of all primes enumerated inincreasing order. Denote by R(A, B) = {a b; a ? A, b ? B} the ratio set of A, B ? R+ and put R(A) = R(A, A) for A ? R+ (cf. [3],[4],[5]). Note that R(A, B) 6= R(B, A) in general, however R(A, B) is dense in R+ if and only if R(B, A) is dense in R+
On Polygons Excluding Point Sets
By a polygonization of a finite point set in the plane we understand a
simple polygon having as the set of its vertices. Let and be sets
of blue and red points, respectively, in the plane such that is in
general position, and the convex hull of contains interior blue points
and interior red points. Hurtado et al. found sufficient conditions for the
existence of a blue polygonization that encloses all red points. We consider
the dual question of the existence of a blue polygonization that excludes all
red points . We show that there is a minimal number , which is
polynomial in , such that one can always find a blue polygonization
excluding all red points, whenever . Some other related problems are
also considered.Comment: 14 pages, 15 figure
A note on large Kakeya sets
A Kakeya set in an affine plane of order is the point set
covered by a set of pairwise non-parallel lines. Large
Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya
sets with size at least contain a large knot (a point of
lying on many lines of ). In this paper, we improve
on this result by showing that Kakeya set of size at least contain a large knot. Furthermore, we obtain a
sharp result for planes of square order containing a Baer subplane.Comment: To appear in Advances in Geometr
- …