English
Related papers

Related papers: Sets that contain their circle centers

200 papers

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

Combinatorics · Mathematics 2021-10-13 Mehdi Makhul , Rom Pinchasi

Let $P$ be a finite point set in the plane. A \emph{$c$-ordinary triangle} in $P$ is a subset of $P$ consisting of three non-collinear points such that each of the three lines determined by the three points contains at most $c$ points of…

We prove: If a complete connected smooth surface M in euclidean 3-space has general position, intersects some plane along a clean figure-8 (a loop with total curvature zero) and all compact intersections with planes have central symmetry,…

Differential Geometry · Mathematics 2015-09-17 Bruce Solomon

We investigate the question of whether or not the orbit of a point in A/Q, under the natural action of a subset S of Q, is dense in A/Q. We prove that if the set S is a multiplicative semigroup which contains at least two multiplicatively…

Number Theory · Mathematics 2013-03-08 Alan Haynes , Sara Munday

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

Rings and Algebras · Mathematics 2024-08-20 Gustavo Granja , Aleksandar Milivojevic

Let $P$ be a geodesic plane in a convex cocompact, acylindrical hyperbolic 3-manifold $M$. Assume that $P^*=M^*\cap P$ is nonempty, where $M^*$ is the interior of the convex core of $M$. Does this condition imply that $P$ is either closed…

Geometric Topology · Mathematics 2022-03-21 Yongquan Zhang

The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that for any point set $P$ of $n$ points in $\mathbb{R}^d$, there is a point $c$, not necessarily from $P$, such that each halfspace containing…

Computational Geometry · Computer Science 2018-10-25 Alexander Pilz , Patrick Schnider

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

Combinatorics · Mathematics 2008-07-11 Joshua Cooper , Mark Walters

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

Combinatorics · Mathematics 2025-11-05 Arijit Bishnu , Mathew Francis , Pritam Majumder

We prove discrete Helly-type theorems for pseudohalfplanes, which extend recent results of Jensen, Joshi and Ray about halfplanes. Among others we show that given a family of pseudohalfplanes $\cal H$ and a set of points $P$, if every…

Combinatorics · Mathematics 2021-10-05 Balázs Keszegh

In recent decades, piecewise linear differential systems have attracted considerable attention due to their ability to describe a wide range of phenomena. A central problem, as in the theory of general planar differential systems, is to…

Dynamical Systems · Mathematics 2026-05-07 Sonia Isabel Renteria Alva , Pedro Iván Suárez Navarro

Neumann-Lara and Urrutia showed in 1985 that in any set of n points in the plane in general positionthere is always a pair of points such that any circle through them contains at least (n-2)/60 points. In a series of papers, this result was…

Combinatorics · Mathematics 2008-03-10 Pedro Ramos , Raquel Viaña

We consider the problem of finding embeddings of arc-like continua in the plane for which each point in a given subset is accessible. We establish that, under certain conditions on an inverse system of arcs, there exists a plane embedding…

General Topology · Mathematics 2024-07-25 Ana Anušić , Logan C. Hoehn

In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…

Optimization and Control · Mathematics 2024-09-19 Vo Si Trong Long , Nguyen Mau Nam , Jacob Sharkansky , Nguyen Dong Yen

Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…

Computational Geometry · Computer Science 2025-12-02 Todor Antić , Aleksa Džuklevski , Jiří Fiala , Jan Kratochvíl , Giuseppe Liotta , Morteza Saghafian , Maria Saumell , Johannes Zink

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

The motivating problem addressed by this paper is to describe those non-degenerate sets of points $Z$ in $\mathbb P^3$ whose general projection to a general plane is a complete intersection of curves in that plane. One large class of such…

Algebraic Geometry · Mathematics 2020-09-02 Luca Chiantini , Juan Migliore

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Combinatorics · Mathematics 2013-09-25 József Solymosi , Miloš Stojaković

Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…

Combinatorics · Mathematics 2018-06-28 Quentin Dubroff

We prove that every set of $n$ red and $n$ blue points in the plane contains a red and a blue point such that every circle through them encloses at least $n(1-\frac{1}{\sqrt{2}}) -o(n)$ points of the set. This is a two-colored version of a…

Computational Geometry · Computer Science 2019-07-31 Mercè Claverol , Clemens Huemer , Alejandra Martínez-Moraian