Related papers: Farthest points on flat surfaces
Let (P) denote the problem of existence of a point in the plane of a given triangle T, that is at rational distance from all the vertices of T. In this article, we provide a complete solution to (P) for all equilateral triangles.
In this paper we give an elementary proof of the fact that every uniquely remotal set is singleton in a finite dimensional strictly convex normed linear space. We show that if A is a uniquely remotal M-compact subset with the derived set of…
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…
In this paper we prove an analogue of the discrete spherical maximal theorem of Magyar, Stein, and Wainger, an analogue which concerns maximal functions associated to homogenous algebraic surfaces. Let $\mathfrak{p}$ be a homogenous…
We consider the averages of a function $ f$ on $ \mathbb R ^{n}$ over spheres of radius $ 0< r< \infty $ given by $ A_{r} f (x) = \int_{\mathbb S ^{n-1}} f (x-r y) \; d \sigma (y)$, where $ \sigma $ is the normalized rotation invariant…
It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…
Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.
In this paper, using altering distance functions we obtain a generalization of the results due to B.K. Das and S. Gupta as well as the results given by B. Samet and H. Yazid. Moreover, we study the so-called property P for the contraction…
Let $\Omega$ be a domain in a smooth complete Finsler manifold, and let $G$ be the largest open subset of $\Omega$ such that for every $x$ in $G$ there is a unique closest point from $\partial \Omega$ to $x$ (measured in the Finsler…
Basic properties of the center of distances of a set are investigated. Computation of the center for achievement sets is particularly aimed at. A new sufficient condition for the center of distances of the set of subsums of a fast…
We prove fixed points results for sandpiles starting with arbitrary initial conditions. We give an effective algorithm for computing such fixed points, and we refine it in the particular case of SPM.
For two points $p$ and $q$ in the plane, a straight line $h$, called a highway, and a real $v>1$, we define the \emph{travel time} (also known as the \emph{city distance}) from $p$ and $q$ to be the time needed to traverse a quickest path…
We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…
The first aim of this paper is to examine some important properties of soft metric spaces. Second is to introduce soft continuous mappings and investigate properties of soft continuous mappings. Third is to prove some fixed point theorems…
The physical deflection angle of a light ray propagating in a space-time supplied with an asymptotically flat metric has to be expressed in terms of the impact parameter.
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…
In this paper we consider flat metrics (semi-translation structures) on surfaces of finite type. There are two main results. The first is a complete description of when a set of simple closed curves is spectrally rigid, that is, when the…
We give a complete characterization of closed sets $F \subset \mathbb{R}^2$ whose distance function $d_F:= \mathrm{dist}(\cdot,F)$ is DC (i.e., is the difference of two convex functions on $\mathbb{R}^2$). Using this characterization, a…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…