English
Related papers

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

200 papers

We show that if a group G acts isometrically on a locally finite leafless R-tree inducing a two-transitive action on its ends, then this tree is determined by the action of G on the boundary. As a corollary we obtain that locally finite…

Metric Geometry · Mathematics 2014-12-02 Koen Struyve

The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…

History and Overview · Mathematics 2013-05-14 Stephan Pfannerer , Philippe Schram

Ballmann's Rank Rigidity Conjecture predicts that a CAT(0) space of higher rank with a geometric group action is rigid -- isometric to a Riemannian symmetric space, a Euclidean building, or splits as a direct product. We confirm this…

Metric Geometry · Mathematics 2022-02-07 Stephan Stadler

We prove that a random group of the graph model associated with a sequence of expanders has fixed-point property for a certain class of CAT(0) spaces. We use Gromov's criterion for fixed-point property in terms of the growth of n-step…

Differential Geometry · Mathematics 2012-10-23 Hiroyasu Izeki , Takefumi Kondo , Shin Nayatani

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

Combinatorics · Mathematics 2013-04-22 Doowon Koh , Hae-Sang Sun

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Algebraic Geometry · Mathematics 2017-08-31 Masahiro Shiota

In this article, we prove that for a definable set in an o-minimal structure with connected link (at 0 or infinity), the inner distance of the link is equivalent to the inner distance of the set restricted to the link. With this result, we…

Metric Geometry · Mathematics 2024-03-05 José Edson Sampaio

This paper studies the strong quasiconvexity of norm and distance functions in finite-dimensional normed spaces. Although the Euclidean norm is known to be strongly quasiconvex on bounded convex sets, a complete characterization of this…

Optimization and Control · Mathematics 2026-05-26 V. S. T. Long , N. M. Nam

We prove that any convex flat subset in a complete Euclidean building is contained in an apartment of the maximal system of apartments.

Metric Geometry · Mathematics 2026-03-24 Raphael Appenzeller , Auguste Hébert , Alexander Lytchak

Median spaces are spaces in which for every three points the three intervals between them intersect at a single point. It is well known that rank-1 affine buildings are median spaces, but by a result of Haettel, higher rank buildings are…

Metric Geometry · Mathematics 2023-11-14 Shaked Bader , Nir Lazarovich

A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$ onto $\mathrm{M}$ extending $f$. A metric space…

Combinatorics · Mathematics 2011-07-26 Norbert Sauer

We show that every $n$-quasiflat in a $n$-dimensional $CAT(0)$ cube complex is at finite Hausdorff distance from a finite union of $n$-dimensional orthants. Then we introduce a class of cube complexes, called {\em weakly special} cube…

Group Theory · Mathematics 2017-06-14 Jingyin Huang

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Metric Geometry · Mathematics 2007-05-23 Andreas Balser

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Combinatorics · Mathematics 2018-02-20 Alex Iosevich , Hans Parshall

Given a fixed closed manifold M, we exhibit an explicit formula for the distance function of the canonical L^2 Riemannian metric on the manifold of all smooth Riemannian metrics on M. Additionally, we examine the (metric) completion of the…

Differential Geometry · Mathematics 2011-07-28 Brian Clarke

Based on the intuitive notion of convexity, we formulate a universal property defining interval objects in a category with finite products. Interval objects are structures corresponding to closed intervals of the real line, but their…

Category Theory · Mathematics 2025-05-01 Martin Escardo , Alex Simpson

We characterize the surjective isometries, with respect to the Hausdorff distance, of the class of bodies given by intersections of Euclidean unit balls. We show that any such isometry is given by the composition of a rigid motion with…

Metric Geometry · Mathematics 2025-07-09 Shiri Artstein-Avidan , Arnon Chor , Dan Florentin

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…

Networking and Internet Architecture · Computer Science 2009-06-10 Rodrigo S. C. Leao , Valmir C. Barbosa

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the…

Computational Geometry · Computer Science 2010-07-19 Keiko Imai , Akitoshi Kawamura , Jiří Matoušek , Daniel Reem , Takeshi Tokuyama