中文
相关论文

相关论文: Line transversals to disjoint balls

200 篇论文

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

几何拓扑 · 数学 2007-05-23 Julia Viro

Let $D$ be a non-pseudoconvex open set in $\C^3$ and $S$ be the union of all two-dimensional planes with non-empty and non-pseudoconvex intersection with $D.$ Sufficient conditions are given for $\C^3\setminus S$ to belong to a complex…

复变函数 · 数学 2012-11-19 Nikolai Nikolov , Peter Pflug

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

复变函数 · 数学 2019-09-11 Sushil Gorai

Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…

计算几何 · 计算机科学 2024-07-02 Valentino Boucard , Guilherme D. da Fonseca , Bastien Rivier

The main results here are two Helly type theorems for the sum of (at most) unit vectors in a normed plane. Also, we give a new characterization of centrally symmetric convex sets in the plane.

度量几何 · 数学 2013-10-04 Imre Bárány , Jesús Jerónimo-Castro

We prove the diameter of the intersection of two closed convex balls in a Riemannian manifold eventually decreases continuously as the centers of the balls move apart.

微分几何 · 数学 2019-09-20 Meera Mainkar , Benjamin Schmidt

Complementing our previous results, we give a classification of all isometries (not necessarily surjective) of the metric space consisting of ball-bodies, endowed with the Hausdorff metric. "Ball bodies" are convex bodies which are…

度量几何 · 数学 2025-03-05 Shiri Artstein-Avidan , Arnon Chor , Dan Florentin

This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…

动力系统 · 数学 2025-11-12 Yunping Jiang

We obtain three Helly-type results. First, we establish a Quantitative Colorful Helly-type theorem with the optimal Helly number \(2d\) concerning the diameter of the intersection of a family of convex bodies. Second, we prove a…

组合数学 · 数学 2024-09-24 G. Ivanov , M. Naszodi

The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called…

组合数学 · 数学 2011-10-25 Martin Tancer

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

组合数学 · 数学 2022-08-31 Nikita Chernega , Alexandr Polyanskii , Rinat Sadykov

We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend…

度量几何 · 数学 2015-08-11 J. A. De Loera , R. N. La Haye , D. Oliveros , E. Roldán-Pensado

We examine the various linkings in space-time of ``ball-like'' and ``ring-like'' topological solitons in certain nonlinear sigma models in 2+1 and 3+1 dimensions. By going to theories where soliton overlaps are forbidden, these linkings…

高能物理 - 理论 · 物理学 2009-10-22 Lee Brekke , Shane J. Hughes , Tom D. Imbo

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

组合数学 · 数学 2024-02-14 Balázs Keszegh

We solve the following geometric problem, which arises in several three-dimensional applications in computational geometry: For which arrangements of two lines and two spheres in R^3 are there infinitely many lines simultaneously…

代数几何 · 数学 2007-05-23 Gábor Megyesi , Frank Sottile , Thorsten Theobald

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

组合数学 · 数学 2020-05-05 Sherry Sarkar , Alexander Xue , Pablo Soberón

In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line…

计算几何 · 计算机科学 2012-11-22 Lena Schlipf

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

计算几何 · 计算机科学 2022-09-07 Helena Bergold , Daniel Bertschinger , Nicolas Grelier , Wolfgang Mulzer , Patrick Schnider

Final revision. To appear in the Journal of Differential Geometry. This paper studies knots that are transversal to the standard contact structure in $\reals^3$, bringing techniques from topological knot theory to bear on their transversal…

几何拓扑 · 数学 2007-05-23 Joan S. Birman , Nancy C. Wrinkle

We define a class of $L$-convex-concave subsets of $\mathbb{R}P^3$, where $L$ is a projective line in $\mathbb{R}P^3$. These are sets whose sections by any plane containing $L$ are convex and concavely depend on this plane. We prove a…

微分几何 · 数学 2007-05-23 A. Khovanskii , D. Novikov