Related papers: Farthest points on flat surfaces

Let $T$ be an orientation-preserving Lipschitz expanding map of the circle $\T$. A pre-image selector is a map $\tau:\T\to\T$ with finitely many discontinuities, each of which is a jump discontinuity, and such that $\tau(x)\in T^{-1}(x)$…

The Cartesian squares (powers) of manifolds with the fixed point property (f.p.p.) are considered. Examples of manifolds with the f.p.p. are constructed whose symmetric squares fail to have the f.p.p..

The well-known von Bahr--Esseen bound on the absolute $p$th moments of martingales with $p\in(1,2]$ is extended to a large class of moment functions, and now with a best possible constant factor (which depends on the moment function). This…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.

This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…

In this paper, we mainly consider the problem of spherical distribution of 5 points, that is, how to configure 5 points on a sphere such that the mutual distance sum attains the maximum. It is conjectured that the sum of distances is…

Let $G$ be a finite, simple connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ of $G$ is the maximum of the average distances…

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

The measurement of distance between two objects is generalized to the case where the objects are no longer points but are one-dimensional. Additional concepts such as non-extensibility, curvature constraints, and non-crossing become central…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We obtain the distance of closest approach of the surfaces of two arbitrary ellipsoids valid at any orientation and separation, measured along their inter-center vector. This directional distance is derived from the Elliptic Contact…

A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…

Let $p$ be a prime number. We define the notion of $F$-finiteness of homomorphisms of $\mathbb F_p$-algebras, and discuss some basic properties. In particular, we prove a sort of descent theorem on $F$-finiteness of homomorphisms of…

We extend the notion of Fermi coordinates to a generalized definition in which the highest orders are described by arbitrary functions. From this definition rises a formalism that naturally gives coordinate transformation formulae. Some…

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…

The distance of closest approach of hard particles is a key parameter of their interaction and plays an important role in the resulting phase behavior. For non-spherical particles, the distance of closest approach depends on orientation,…

A set of points $S \subseteq \mathbb{F}_p^n$ is called \emph{$p$-divisible} if every affine hyperplane in $\mathbb{F}_p^n$ intersects $S$ in $0 \pmod p$ points. The Strong Cylinder Conjecture of Ball asserts that if $S$ is a $p$-divisible…

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…