Related papers: Steinhaus Sets and Jackson Sets

H. Steinhaus asked in the 1950's whether there exists a set in the plane R^2 meeting every isometric copy of Z^2 in precisely one point. Such a "Steinhaus set" was constructed by Jackson and Mauldin. What about three-space R^3? Is there a…

A Steinhaus set $S \subseteq \RR^d$ for a set $A \subseteq \RR^d$ is a set such that $S$ has exactly one point in common with $\tau A$, for every rigid motion $\tau$ of $\RR^d$. We show here that if $A$ is a finite set of at least two…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Let $K$ be a nonempty finite subset of the Euclidean space $\mathbb{R}^k$ $(k\ge 2)$. We prove that if a function $f\colon \mathbb{R}^k\to \mathbb{C}$ is such that the sum of $f$ on every congruent copy of $K$ is zero, then $f$ vanishes…

Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…

It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…

Let $\mathcal{F}$ be any collection of linearly separable sets of a set $P$ of $n$ points either in $\mathbb{R}^2$, or in $\mathbb{R}^3$. We show that for every natural number $k$ either one can find $k$ pairwise disjoint sets in…

In this paper, we prove two results. First, there is a family of sequences of embedded quarters of the hyperbolic plane such that any sequence converges to a limit which is an end of the hyperbolic plane. Second, there is no algorithm which…

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

We show that the number of $\mathbf{S}$-balanced configurations of four bodies in the plane is finite, provided that the symmetric matrix $\mathbf{S}$ is close to a numerical matrix.

Let $F$ be Cayley's ruled cubic surface in a projective three-space over any commutative field $K$. We determine all collineations fixing $F$, as a set, and all cubic forms defining $F$. For both problems the cases $|K|=2,3$ turn out to be…

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

Assuming PFA, every uncountable subset E of the plane meets some C^1 arc in an uncountable set. This is not provable from MA(aleph_1), although in the case that E is analytic, this is a ZFC result. The result is false in ZFC for C^2 arcs,…

For a set $x$, let $\mathcal{S}(x)$ be the set of all permutations of $x$. We study several aspects of this notion in $\mathsf{ZF}$. The main results are as follows: (1) $\mathsf{ZF}$ proves that for all sets $x$, if $\mathcal{S}(x)$ is…

In this paper, we study the structure of the fixed point sets of noncommutative self maps of the free ball. We show that for such a map that fixes the origin the fixed point set on every level is the intersection of the ball with a linear…

For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…