English
Related papers

Related papers: Nearest point problem in countably normed spaces

200 papers

In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the sum of distances to arbitrarily given points in d-dimensional real normed spaces. Various generalizations of this problem are outlined,…

Metric Geometry · Mathematics 2022-10-11 D. A. Ilyukhin

We give a positive answer to the Chavel's conjecture [J. Diff. Geom. 4 (1970), 13-20]: a simply connected rank one normal homogeneous space is symmetric if any pair of conjugate points are isotropic. It implies that all simply connected…

Differential Geometry · Mathematics 2012-03-22 J. C. González-Dávila , A. M. Naveira

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

Probability · Mathematics 2016-06-08 Sergey Victor Ludkowski

We show that norms on certain Banach spaces $X$ can be approximated uniformly, and with arbitrary precision, on bounded subsets of $X$ by $C^{\infty}$ smooth norms and polyhedral norms. In particular, we show that this holds for any…

Functional Analysis · Mathematics 2022-06-22 Victor Bible , Richard J. Smith

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…

Computational Geometry · Computer Science 2022-09-01 Christophter Thron , Anthony Moreno

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

Computational Geometry · Computer Science 2012-06-21 Laszlo Kozma

We prove that if $K$ is a compact space and the space $P(K\times K)$ of regular probability measures on $K\times K$ has countable tightness in its $weak^*$ topology, then $L_1(\mu)$ is separable for every $\mu\in P(K)$. It has been known…

Functional Analysis · Mathematics 2014-05-13 Grzegorz Plebanek , Damian Sobota

A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…

General Topology · Mathematics 2021-10-05 Igor Protasov

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

Functional Analysis · Mathematics 2007-05-23 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

The problem of classifying boundary points of space-time, for example singularities, regular points and points at infinity, is an unexpectedly subtle one. Due to the fact that whether or not two boundary points are identified or even…

General Relativity and Quantum Cosmology · Physics 2018-11-14 Ingrid Irmer

Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \leq i \leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \textit{optimally} predict the label $Y$ of a given a new observation $X$. In…

Statistics Theory · Mathematics 2014-11-06 Sébastien Gadat , Thierry Klein , Clément Marteau

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Complex Variables · Mathematics 2012-07-24 Anton Baranov , Harald Woracek

When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop…

Methodology · Statistics 2023-11-02 Anvit Garg , Anil K. Ghosh , Soham Sarkar

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

Optimization and Control · Mathematics 2021-12-13 Florian Lauster , D. Russell Luke

In this paper, we introduce a generalized notion of monotone property and prove some results regarding existence and uniqueness of multi-tupled fixed points for nonlinear contraction mappings satisfying monotone property in ordered complete…

Functional Analysis · Mathematics 2016-10-04 Aftab Alam , Mohammad Imdad , Stojan Radenovic

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.

Metric Geometry · Mathematics 2013-07-25 Sibylla Priess-Crampe , Paulo Ribenboim

We describe the norming sets for the space of global holomorphic sections to a $k$-power of a positive holomorphic line bundle on a compact complex manifold $X$. We characterize in metric terms the sequence of measurable subsets…

Complex Variables · Mathematics 2017-04-06 Tanausu Aguilar-Hernandez

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor