Related papers: Points at rational distances from the vertices of …
We study tetrahedra and the space of tetrahedra from the viewpoint of local and global maxima for intrinsic distance functions.
In this article, we generalize the following problem, which is called the rational angle bisection problem, to the $n$-dimensional space $k^n$ over a subfield $k$ of $\mathbb R$: in the coordinate plane, for which rational numbers $a$ and…
We study rationality problems for smooth complete intersections of two quadrics. We focus on the three-dimensional case, with a view toward understanding the invariants governing the rationality of a geometrically rational threefold over a…
In this paper, we give an algorithm to infer the positions of the vertices of an unknown tetrahedron, given a sample of points which are uniformly distributed within the tetrahedron. The accuracy of the algorithm is demonstrated using some…
We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f, and a real positive parameter epsilon, compute a path from s to f…
Recent work on state sum models of quantum gravity in 3 and 4 dimensions has led to interest in the `quantum tetrahedron'. Starting with a classical phase space whose points correspond to geometries of the tetrahedron in R^3, we use…
Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…
Let $Z$ be a projective geometrically integral algebraic variety. This paper is concerned with estimating the number of rational points on $Z$ which have height at most $B$. The bounds obtained are uniform in varieties of fixed degree and…
This is a short survey paper, partly meant as a research announcement. Its purpose is to highlight some aspects of the interplay between quantales, inverse semigroups, and groupoids. Many of the results mentioned have not yet been presented…
We outline an alternative approach to the geometric notion of a saddle point for real-valued functions of two variables. It is argued that this is more natural compared to the usual treatment of this topic in standard texts on Calculus.
Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…
In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…
In machine learning and particularly in topological data analysis, $\epsilon$-graphs are important tools but are generally hard to compute as the distance calculation between n points takes time O(n^2) classically. Recently, quantum…
In this paper, we give an elementary new method for determining the rational points on algebraic curves using torsion packets. We also provide examples of curves for which all rational points can be completely determined by our method.
Cubical rectangles are being defined and explored here over the $n-$dimensional geometric cube $Q_n.$ They form a new class of geometric objects that includes all the edges and all the squares of the $n-$cube. We enumerate and characterize…
A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…
We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…
We consider the question of how well points in a quadric hypersurface $M\subset\mathbb R^d$ can be approximated by rational points of $\mathbb Q^d\cap M$. This contrasts with the more common setup of approximating points in a manifold by…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…