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

The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

Let $p_0,\ldots,p_n$ be a finite sequence of points in an Euclidean space $\R^d$. Suppose that there is a (pointlike) particle sitting at each point $p_i$. In a ``legal'' move, any one of them can jump over another, landing on the other…

We show, under mild hypotheses, that if each element of a finitely generated group acting on a $2$-dimensional $\mathrm{CAT}(0)$ complex has a fixed point, then there is a global fixed point. In particular all actions of finitely generated…

Given a split semisimple group over a local field, we consider the maximal Satake-Berkovich compactification of the corresponding Euclidean building. We prove that it can be equivariantly identified with the compactification which we get by…

For pattern recognition like image recognition, it has become clear that each machine-learning dictionary data actually became data in probability space belonging to Euclidean space. However, the distances in the Euclidean space and the…

Part 1 : For more than two millennia, ever since Euclid's geometry, the so called Archimedean Axiom has been accepted without sufficiently explicit awareness of that fact. The effect has been a severe restriction of our views of space-time,…

Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Extending and unifying a number of well-known conjectures and open questions, we conjecture that locally elliptic (that is, every element has a bounded orbit) actions by automorphisms of finitely generated groups on finite dimensional…

A building is a simplicial complex with a covering by Coxeter complexes (called apartments) satisfying certain combinatorial conditions. A building whose apartments are spherical (respectively Euclidean) Coxeter complexes has a natural…

In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.

This is a survey on nondiscrete euclidean buildings, with a focus on metric properties of these spaces.

We prove that the mapping class group of a Heegaard splitting with a distance of at least 3 is finite. However, we have constructed a counterexample with a distance of 2 that disproves this assertion. In addition, the fact that the mapping…

It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…

We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets…

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…

For a given connected set $\Gamma$ in $d-$dimensional Euclidean space, we construct a connected set $\tilde\Gamma\supset \Gamma$ such that the two sets have comparable Hausdorff length, and the set $\tilde\Gamma$ has the property that it is…