Related papers: Line transversals to disjoint balls

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

This paper describes a way to subdivide a 3-manifold into angled blocks, namely polyhedral pieces that need not be simply connected. When the individual blocks carry dihedral angles that fit together in a consistent fashion, we prove that a…

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

We prove that given a finite collection of cylinders in $\R^3$ with the property that any two them intersect, then there is a line intersecting an $\alpha$ fraction of the cylinders where $\alpha=\frac 1{28}$. This is a special case of an…

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

In this paper we consider the H\'enon problem in a ball. We prove the existence of (at least) one branch of nonradial solutions that bifurcate from the radial ones and that this branch is unbounded.

We generalize the Chern class relation for the transversal intersection of two nonsingular varieties to a relation for possibly singular varieties, under a 'splayedness' assumption. The relation is shown to hold for both the…

We consider the triangular ratio metric and estimate the radius of convexity for balls in some special domains and prove the inclusion relations of metric balls defined by the triangular ratio metric, the quasihyperbolic metric and the…

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…

Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane…

We show that the number of geometric permutations of an arbitrary collection of $n$ pairwise disjoint convex sets in $\mathbb{R}^d$, for $d\geq 3$, is $O(n^{2d-3}\log n)$, improving Wenger's 20 years old bound of $O(n^{2d-2})$.

Sets in R^n in which every pair of elements x, y can be connected by a path in the set of length bounded by a constant multiple of the distance between x and y are considered.

Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…

In the search for transverse-universal knots in the standard contact structure on $\mathbb{S}^3$, we present a classification of the transverse twist knots with maximal self-linking number, that admit only overtwisted contact branched…

We give a Belyi-type characterisation of smooth complete intersections of general type over $\mathbb{C}$ which can be defined over $\bar{\mathbb{Q}}$. Our proof uses the higher-dimensional analogue of the Shafarevich boundedness conjecture…

In this article, we prove that from any sequence of balls whose associated limsup set has full $\mu$-measure, one can extract a well-distributed subsequence of balls. From this, we deduce the optimality of various lower bounds for the…

We prove a fractional Helly theorem for $k$-flats intersecting fat convex sets. A family $\mathcal{F}$ of sets is said to be $\rho$-fat if every set in the family contains a ball and is contained in a ball such that the ratio of the radii…

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

We prove that if $S$ is a smooth reflexive surface in $\mathbb{P}^3$ defined over a finite field $\mathbb{F}_q$, then there exists an $\mathbb{F}_q$-line meeting $S$ transversely provided that $q\geq c\operatorname{deg}(S)$, where…