Related papers: Congruence Testing of Point Sets in 4 Dimensions
We study the breaking of a supersymmetric SO(10) GUT in 6 dimensions by orbifold compactification. In 4 dimensions we obtain a N=1 supersymmetric theory with the standard model gauge group enlarged by an additional U(1) symmetry. The…
Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…
In this paper we will show that two surfaces of the same genus and homology class in a simply connected 4-manifold are concordant. We will show they are often topologically isotopic when their complements have cyclic fundamental group.…
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…
It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…
We will look for stable structures in four situations and discuss what is known and unknown.
A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…
According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…
We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon…
Gorenstein liaison seems to be the natural notion to generalize to higher codimension the well-known results about liaison of varieties of codimension~2 in projective space. In this paper we study points in ${\mathbb P}^3$ and curves in…
Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…
In this article, constant dimension subspace codes whose codewords have subspace distance in a prescribed set of integers, are considered. The easiest example of such an object is a {\it junta}; i.e. a subspace code in which all codewords…
Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…
Generalized coherent states are developed for SU(n) systems for arbitrary $n$. This is done by first iteratively determining explicit representations for the SU(n) coherent states, and then determining parametric representations useful for…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
The complexity of two related geometrical (indeed, combinatorial) problems is considered, measured by the number of queries needed to determine the solution. It is proved that one cannot check in a linear in N number of queries whether N…
To assess whether there is some signal in a big database, aggregate tests for the global null hypothesis of no effect are routinely applied in practice before more specialized analysis is carried out. Although a plethora of aggregate tests…