English
Related papers

Related papers: Sets that contain their circle centers

200 papers

We prove that if two subsets ${A}$ and ${B}$ of the plane are connected, ${A}$ is bounded, and the Euclidean distance $\rho({A},{B})$ between ${A}$ and ${B}$ is greater than zero, then for every positive $\varepsilon<\rho({A},{B})$, the…

General Topology · Mathematics 2024-04-01 Aleksei Volkov , Mikhail Patrakeev

In the 1960s Moser asked how dense a subset of $\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense…

Metric Geometry · Mathematics 2024-07-09 Alex Cohen , Nitya Mani

We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.

Optimization and Control · Mathematics 2018-02-12 Marcel K. de Carli Silva , Levent Tunçel

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López

We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions…

Computational Geometry · Computer Science 2010-01-21 Nina Amenta , Marshall Bern , David Eppstein , Shang-Hua Teng

The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…

Combinatorics · Mathematics 2017-08-31 Paul Manuel , Sandi Klavžar

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

Algebraic Geometry · Mathematics 2013-09-17 Mohammad Ghomi , Ralph Howard

Consider analytical three-dimensional differential systems having a singular point at the origin such that its linear part is $y\partial_x-\lambda z\partial_z$ for some $\lambda\neq 0$. The restriction of such systems to a Center Manifold…

Dynamical Systems · Mathematics 2021-10-07 Lucas Queiroz , Claudio Pessoa

Given a finite set of points $C \subseteq \mathbb{R}^d$, we say that an ordering of $C$ is protrusive if every point lies outside the convex hull of the points preceding it. We give an example of a set $C$ of $5$ points in the Euclidean…

Combinatorics · Mathematics 2023-09-25 Adrian Beker

We prove density of hyperbolicity in spaces of (i) real transcendental entire functions, bounded on the real line, whose singular set is finite and real and (ii) transcendental self-maps of the punctured plane which preserve the circle and…

Dynamical Systems · Mathematics 2015-11-03 Lasse Rempe-Gillen , Sebastian van Strien

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

Combinatorics · Mathematics 2025-07-24 Jesús A. De Loera , Gyivan Lopez-Campos , Antonio J. Torres

In this paper we study the linear series |L-3p| of hyperplane sections with a triple point p of a surface S embedded via a very ample line bundle L for a general point p. If this linear series does not have the expected dimension we call…

Algebraic Geometry · Mathematics 2009-11-06 Luca Chiantini , Thomas Markwig

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.

Geometric Topology · Mathematics 2014-12-11 Charalampos Charitos , Ioannis Papadoperakis , Georgios Tsapogas

We study the problem of rigidity of closures of totally geodesic plane immersions in geometrically finite manifolds containing rank $1$ cusps. We show that the key notion of K-thick recurrence of horocycles fails generically in this…

Dynamical Systems · Mathematics 2021-10-12 Osama Khalil

We prove that if a finite point set in real space does not have too many points on a plane, then it spans a quadratic number of ordinary lines. This answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows that there is…

Combinatorics · Mathematics 2018-03-28 Frank de Zeeuw

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

Combinatorics · Mathematics 2018-04-26 Maarten De Boeck , Geertrui Van de Voorde

Often some interesting or simply curious points are left out when developing a theory. It seems that one of them is the existence of an upper bound for the fraction of area of a convex and closed plane area lying outside a circle with which…

General Mathematics · Mathematics 2007-05-23 Jose M. Pacheco

We consider here the $3$-sphere $\mathbf S^3$ seen as the boundary at infinity of the complex hyperbolic plane $\mathbf{H}^2_{\mathbf C}$. It comes equipped with a contact structure and two classes of special curves. First $\mathbf…

Geometric Topology · Mathematics 2022-05-19 Elisha Falbel , Antonin Guilloux , Pierre Will

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to…

Combinatorics · Mathematics 2019-12-18 Adam S. Jobson , André E. Kézdy , Jenő Lehel , Timothy J. Pervenecki , Géza Tóth

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

Computational Geometry · Computer Science 2025-07-15 Jack Spalding-Jamieson , Anurag Murty Naredla