Related papers: Distances on a one-dimensional lattice from noncom…
We show that there is an operator with a simple geometric significance which yields the ordinary geometry of a linear equidistant lattice via Connes' distance function.
Connes' distance formula is applied to endow linear metric to three 1D lattices of different topology, with a generalization of lattice Dirac operator written down by Dimakis et al to contain a non-unitary link-variable. Geometric…
For almost twenty years, a search for a Lorentzian version of the well-known Connes' distance formula has been undertaken. Several authors have contributed to this search, providing important milestones, and the time has now come to put…
Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…
A method is presented for calculating the Lie point symmetries of a scalar difference equation on a two-dimensional lattice. The symmetry transformations act on the equations and on the lattice. They take solutions into solutions and can be…
Based on a fairly precise approximation to the lattice discrepancy of a Lame disc, an asymptotic formula is established for the number of lattice points in a related three-dimensional body, linearly dilated by a large real parameter x.…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m…
If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…
Following the general principles of noncommutative geometry, it is possible to define a metric on the space of pure states of the noncommutative algebra generated by the coordinates. This metric generalizes the usual Riemannian one. We…
In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…
The Lorentzian distance formula, conjectured several years ago by Parfionov and Zapatrin, has been recently proved by the second author. In this work we focus on the derivation of an equivalent expression in terms of the geometry of…
What is the distance between two points in spacetime? This is a basic geometric question, which so far has no single, definitive answer. Unlike their Riemannian cousins, Lorentzian manifolds are not known to carry a canonical distance…
Lipman et al. [ACM Transactions on Graphics 29 (3) (2010), 1--11] introduced the concept of biharmonic distance to measure the distances between pairs of points on a 3D surface. Biharmonic distance has some advantages over resistance…
A kinetics built upon $q$-calculus, the calculus of discrete dilatations, is shown to describe diffusion on a hierarchical lattice. The only observable on this ultrametric space is the "quasi-position" whose eigenvalues are the levels of…
The bipartite matching problem is widely applied in the field of transportation; e.g., to find optimal matches between supply and demand over time and space. Recent efforts have been made on developing analytical formulas to estimate the…