Related papers: Stabbing Pairwise Intersecting Disks by Four Point…

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…

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…

The procedure to remove double intersections called the Whitney trick is one of the main tools in the topology of manifolds. The analogues of Whitney trick for $r$-tuple intersections were `in the air' since 1960s. However, only recently…

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

In a recent paper, Francis, Illickan, Jose and Rajendraprasad showed that every $n$-vertex plane graph $G$ has (under some natural restrictions) a vertex-partition into two sets $V_1$ and $V_2$ such that each $V_i$ is \emph{dominating}…

In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection graph $G$, our goal is to compute a set of vertices hitting all…

Define the 1-handle stabilization distance between two surfaces properly embedded in a fixed 4-dimensional manifold to be the minimal number of 1-handle stabilizations necessary for the surfaces to become ambiently isotopic. For every…

It is well-known that all 2-knots are slice. Are all 2-links slice? This is an outstanding open question. In this paper we prove the following: For any 2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is an…

We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…

A change point problem occurs in many statistical applications. If there exist change points in a model, it is harmful to make a statistical analysis without any consideration of the existence of the change points and the results derived…

Main Result: Let $(M,L)$ be a smooth complex polarized threefold. Then the linear system $| K+tL|$ separates any two different points on $M$ for any $t\ge 6$, where $K$ is the canonical bundle of $M$. The argument in the proof is a variant…

Satisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a century ago. In the 1930s, Esther Klein's exploration of…

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Conjecturally, a knot is slice if and only if its positive Whitehead double is slice. We consider an analogue of this conjecture for slice disks in the four-ball: two slice disks of a knot are smoothly isotopic if and only if their positive…

Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Development in lattice strain mapping using four-dimensional scanning transmission electron microscopy (4D-STEM) method now offers improved precision and feasibility. However, automatic and accurate diffraction analysis is still challenging…

A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc networks. Because the minimum dominating set problem for unit…