In the following paper we continue the work of Bimonte-Lizzi-Sparano on distances on a one dimensional lattice. We succeed in proving analytically the exact formulae for such distances. We find that the distance to an even point on the lattice is the geometrical average of the "predecessor" and "succesor" distances to the neighbouring odd points
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...
AbstractLet m and k be two fixed positive integers such that m>k⩾2. Let V be a left vector space ove...
AbstractProof of a general inequality connecting point sets with lattices in a space of Laurent seri...
AbstractWe prove a definable/subanalytic version of a useful lemma, presumably due to John Nash, con...
We study the minimum number of different distances defined by a finite number of points in the follo...
AbstractFor the finite field Fp one may consider the distance between r1(n) and r2(n), where r1, r2 ...
Every set of points P determines Ω(|P|/log|P|) distances. A close version of this was initially conj...
AbstractWe construct a set of n points (i) on the unit sphere Sd-1 (d⩾4) so that they determine o(n)...
A celebrated theorem due to Bannai-Bannai-Stanton says that if A is a set of points in ℝ^d, which de...
AbstractDistance geometry provides us with an implicit characterization of the Euclidean metric in t...
AbstractIn a recent paper on the theory of Euclidean distance matrices, Gower derived an inequality ...
Using the tools of noncommutative geometry we calculate the distances between the points of a lattic...
We construct finite sets of real numbers that have a small difference set and strong local propertie...
A subset of a normed space X is called equilateral if the distance between any two points is the sa...
AbstractA finite set X in the d-dimensional Euclidean space is called an s-distance set if the set o...
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...
AbstractLet m and k be two fixed positive integers such that m>k⩾2. Let V be a left vector space ove...
AbstractProof of a general inequality connecting point sets with lattices in a space of Laurent seri...
AbstractWe prove a definable/subanalytic version of a useful lemma, presumably due to John Nash, con...
We study the minimum number of different distances defined by a finite number of points in the follo...
AbstractFor the finite field Fp one may consider the distance between r1(n) and r2(n), where r1, r2 ...
Every set of points P determines Ω(|P|/log|P|) distances. A close version of this was initially conj...
AbstractWe construct a set of n points (i) on the unit sphere Sd-1 (d⩾4) so that they determine o(n)...
A celebrated theorem due to Bannai-Bannai-Stanton says that if A is a set of points in ℝ^d, which de...
AbstractDistance geometry provides us with an implicit characterization of the Euclidean metric in t...
AbstractIn a recent paper on the theory of Euclidean distance matrices, Gower derived an inequality ...
Using the tools of noncommutative geometry we calculate the distances between the points of a lattic...
We construct finite sets of real numbers that have a small difference set and strong local propertie...
A subset of a normed space X is called equilateral if the distance between any two points is the sa...
AbstractA finite set X in the d-dimensional Euclidean space is called an s-distance set if the set o...
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...
AbstractLet m and k be two fixed positive integers such that m>k⩾2. Let V be a left vector space ove...
AbstractProof of a general inequality connecting point sets with lattices in a space of Laurent seri...