Related papers: Distance problems for planar hypercomplex numbers
We undertake to develop a successful framework for commutative-associative hypercomplex numbers with the view to explicate and study associated geometric and generalized-relativistic concepts, basing on an interesting possibility to…
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…
We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?
The transportation problem in the plane - how to move a set of objects from one set of points to another set of points in the cheapest way - is a very old problem going back several hundreds of years. In recent years the solution of the…
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…
We present a mathematical model for a physical theory that is compatible with Einstein's Special Relativity Theory. Our model consists of three pseudo-complex dimensions, representing three real dimensions of space, dual to what could be…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
Two measurable sets $S, \Lambda \subseteq \mathcal{R}^d$ form a Heisenberg uniqueness pair, if every bounded measure $\mu$ with support in S whose Fourier transform vanishes on {\Lambda} must be zero. We show that a quadratic hypersurface…
A semilinear ordinary differential equation is derived from a semilinear Schr\"odinger equation in the homogeneous and isotropic spacetime by the Ehrenfest theorem. The Cauchy problem for the equation is considered. Exact solutions and…
There is a tendency to write the equations of general relativity as a first order symmetric system of time dependent partial differential equations. However, for numerical reasons, it might be advantageous to use a second order formulation…
We propose global surjectivity theorems of differentiable maps based on second order conditions. Using the homotopy continuation method, we demonstrate that, for a $C^2$ differentiable map from a Hilbert space to a finite-dimensional…
Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
We introduce and study the Dirichlet problem for double divergence form elliptic equations with coefficients of low regularity and boundary conditions given by general Borel measures. Under broad assumptions we establish the solvability of…
Distance metric learning is of fundamental interest in machine learning because the distance metric employed can significantly affect the performance of many learning methods. Quadratic Mahalanobis metric learning is a popular approach to…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
This paper surveys some recent results on existence, uniqueness and removable singularities for fully nonlinear differential equations on manifolds. The discussion also treats restriction theorems and the strong Bellman principle.
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
Existing theoretical stabilization results for linear, hyperbolic multi-dimensional problems are extended to the discretized multi-dimensional problems. In contrast to existing theoretical and numerical analysis in the spatially…
Applications in data science, shape analysis and object classification frequently require comparison of probability distributions defined on different ambient spaces. To accomplish this, one requires a notion of distance on a given class of…