Related papers: On existence of integral point sets and their diam…
A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
Let $P$ be a finite set of points in $\mathbb{R}^d$ or $\mathbb{C}^d$. We answer a question of Purdy on the conditions under which the number of hyperplanes spanned by $P$ is at least the number of $(d-2)$-flats spanned by $P$. In answering…
Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
We consider the problem of finding the matching map between two sets of $d$ dimensional vectors from noisy observations, where the second set contains outliers. The matching map is then an injection, which can be consistently estimated only…
We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)
A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…
Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…
We propose a notion of integral Menger curvature for compact, $m$-dimensional sets in $n$-dimensional Euclidean space and prove that finiteness of this quantity implies that the set is $C^{1,\alpha}$ embedded manifold with the H{\"o}lder…
We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…
Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
The dispersion of a point set in $[0,1]^d$ is the volume of the largest axis parallel box inside the unit cube that does not intersect with the point set. We study the expected dispersion with respect to a random set of $n$ points…
For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for solving symmetric integer linear programs (ILPs). An integer…