相关论文: On the Density of Iterated Line Segment Intersecti…

We show that a typical Besicovitch set $B$ has intersections of measure zero with every line not contained in it. Moreover, every line in $B$ intersects the union of all the other lines in $B$ in a set of measure zero.

Given a real projective variety $X$ and $m$ ample line bundles $L_1,\dots L_m$ on $X$ also defined over $\mathbb{R}$, we study the topology of the real locus of the complete intersections defined by global sections of $L_1^{\otimes…

Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…

We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an…

The paper discusses two models for non-overlapping finite line-segments constructed via the lilypond protocol, operating here on a given array of points in the plane with which are associated directions. At time 0, each line-segment starts…

A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…

For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…

The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…

The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…

Inspired by the work of Newhouse in one real variable, we introduce a relevant notion of thickness for dynamical Cantor sets of the plane associated to a holomorphic IFS. Our main result is a complex version of Newhouse's Gap Lemma : we…

Let $(X,d,m)$ be a geodesic metric measure space. Consider a geodesic $\mu_{t}$ in the $L^{2}$-Wasserstein space. Then as $s$ goes to $t$ the support of $\mu_{s}$ and the support of $\mu_{t}$ have to overlap, provided an upper bound on the…

In this paper we introduce the concept of infinite pointwise dense lineability (spaceability), and provide a criterion to obtain density from mere lineability. As an application, we study the linear and topological structures within the set…

The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…

We show that any set of $n$ points in general position in the plane determines $n^{1-o(1)}$ pairwise crossing segments. The best previously known lower bound, $\Omega\left(\sqrt n\right)$, was proved more than 25 years ago by Aronov, Erd\H…

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…

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…