English
Related papers

Related papers: Distances between fixed-point sets in 2-dimensiona…

200 papers

In order to characterize molecular structures we introduce configurational fingerprint vectors which are counterparts of quantities used experimentally to identify structures. The Euclidean distance between the configurational fingerprint…

The aim of this note is to give an easy example of a finitely presented group that cannot act without a fix point on a CAT(0) space of finite dimension. Such an example has been recently constructed by Arjantseva et al., using other…

Group Theory · Mathematics 2009-01-13 Indira Chatterji , Martin Kassabov

We construct a set of $2^n$ points in $\mathbb{R}^n$ such that all pairwise Manhattan distances are odd integers, which improves the recent linear lower bound of Golovanov, Kupavskii and Sagdeev. In contrast to the Euclidean and maximum…

Combinatorics · Mathematics 2024-10-25 Alberto Espuny Díaz , Emma Hogan , Freddie Illingworth , Lukas Michel , Julien Portier , Jun Yan

We prove some geometric properties of sets in the first Heisenberg group whose Heisenberg Hausdorff dimension is the minimal or maximal possible in relation to their Euclidean one and the corresponding Hausdorff measures are positive and…

Classical Analysis and ODEs · Mathematics 2017-05-12 Pertti Mattila , Laura Venieri

Dimension-varying linear systems are investigated. First, a dimension-free state space is proposed. A cross dimensional distance is constructed to glue vectors of different dimensions together to form a cross-dimensional topological space.…

Dynamical Systems · Mathematics 2019-04-17 Daizhan Cheng , Zhenhui Xu , Tielong Shen

We consider the unitary group $\U$ of complex, separable, infinite-dimensional Hilbert space as a discrete group. It is proved that, whenever $\U$ acts by isometries on a metric space, every orbit is bounded. Equivalently, $\U$ is not the…

Functional Analysis · Mathematics 2007-05-23 Eric Ricard , Christian Rosendal

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

Metric Geometry · Mathematics 2013-06-25 Dmitri Burago , Sergei Ivanov

We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki , Makoto Tagami

We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…

Computational Geometry · Computer Science 2019-06-13 Jeff M. Phillips , Pingfan Tang

In Euclidean spaces, the geometric notions of nearest-points map, farthest-points map, Chebyshev set, Klee set, and Chebyshev center are well known and well understood. Since early works going back to the 1930s, tremendous theoretical…

Optimization and Control · Mathematics 2010-03-17 Heinz H. Bauschke , Mason S. Macklem , Xianfu Wang

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

Number Theory · Mathematics 2022-05-03 Doowon Koh , Minh Quy Pham , Thang Pham

Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in $\mathbb{R}^d$ ($d \geq 1$), or equivalently, distance spaces that can be isometrically…

Computational Geometry · Computer Science 2025-03-26 Matthias Bentert , Fedor V. Fomin , Petr A. Golovach , M. S. Ramanujan , Saket Saurabh

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

Functional Analysis · Mathematics 2021-03-26 Vladyslav Babenko , Vira Babenko , Oleg Kovalenko

For the unit sphere S^d in Euclidean space R^(d+1), we show that for d-1<s<d and any N>1, discrete N-point minimal Riesz s-energy configurations are well separated in the sense that the minimal distance between any pair of distinct points…

Mathematical Physics · Physics 2007-05-23 A. B. J. Kuijlaars , E. B. Saff , X. Sun

Complete hyperbolicity of small Euclidean balls with respect to a C^1-smooth almost complex structure standard at origin is improved to give a complete hyperbolicity of strictly pseudoconvex domains. More precise (and lower) regularity…

Complex Variables · Mathematics 2007-05-23 S. Ivashkovich , J. -P. Rosay

We study the topology of metric spaces which are definable in o-minimal expansions of ordered fields. We show that a definable metric space either contains an infinite definable discrete set or is definably homeomorphic to a definable set…

Logic · Mathematics 2015-11-12 Erik Walsberg

We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…

Combinatorics · Mathematics 2026-05-21 Jan Willemson

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

Dynamical Systems · Mathematics 2015-08-17 Péter Pál Varjú

Let $H$ be an atomic monoid. The set of distances $\Delta (H)$ of $H$ is the set of all $d \in \mathbb{N}$ with the following property: there are irreducible elements $u\_1, \ldots, u\_k, v\_1 \ldots, v\_{k+d}$ such that $u\_1 \cdot \ldots…

Commutative Algebra · Mathematics 2017-01-19 Alfred Geroldinger , Wolfgang Schmid

We give a geometric construction of neural networks that separate disjoint compact subsets of $\Bbb R^n$, and use it to obtain a constructive universal approximation theorem. Specifically, we show that networks with two hidden layers and…

Machine Learning · Computer Science 2026-02-16 Chanyoung Sung