Related papers: The number of point-splitting circles

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

Let $L$ be any integral lattice in the 2-dimensional Euclidean space. Generalizing the earlier works of Hiroshi Maehara and others, we prove that for every integer $n>0$, there is a circle in the plane $\mathbb{R}^{2}$ that passes through…

It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

A quadrangle in the Euclidean plane is called $n$-self-affine if it has a dissection into $n$ affine images of itself. All convex quadrangles are known to be $n$-self-affine for every $n \ge 5$. The only $2$-self-affine convex quadrangles…

We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.

Let $G$ be a finite abelian group. We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation.…

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\in\left(1-\frac{1}{n},1\right]$ in dimensions $\geq2$ and…

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

We consider circular version of the famous Nelson-Hadwiger problem. It is know that 4 colors are necessary and 7 colors suffice to color the euclidean plane in such a way that points at distance one get different colors. In $r$-circular…

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

Because the problem of Apollonius is generally considered over the reals, it suffers from variance of number: there are at most eight circles simultaneously tangent to a given trio of circles, but some configurations have fewer than eight…

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that $3{\lfloor\frac{n}{2}\rfloor}$ internal Steiner…

In this paper we study circles tangent to conics. We show there are generically $184$ complex circles tangent to three conics in the plane and we characterize the real discriminant of the corresponding polynomial system. We give an explicit…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

The aim of this paper is to generalize Apollonius' problem. The problem is to construct a circle that is tangent to three given circles in a plane. We find the maximum possible number of solution circles in the case of more than the three…

Let n be aninteger>4. There is a smoothly knotted n-dimensional sphere in (n+2)-space such that the singular point set of its projection in (n+1)-space consists of double points and that the components of the singular point set are two.…

Let $C_1, \dots, C_n$ denote the $1/n-$neighborhood of $n$ great circles on $\mathbb{S}^2$. We are interested in how much these areas have to overlap and prove the sharp bounds $$ \sum_{i, j = 1 \atop i \neq j}^{n}{|C_i \cap C_j|^s}…