English
Related papers

Related papers: Nearest point problem in countably normed spaces

200 papers

In this paper, we deal with a hyperspace selection problem in the setting of connected spaces. We present two solutions of this problem illustrating the difference between selections for the nonempty closed sets, and those for the at most…

General Topology · Mathematics 2024-01-22 Valentin Gutev

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

Data Structures and Algorithms · Computer Science 2025-04-30 Aditya Bhaskara , Sepideh Mahabadi , Madhusudhan Reddy Pittu , Ali Vakilian , David P. Woodruff

Biased sampling and missing data complicates statistical problems ranging from causal inference to reinforcement learning. We often correct for biased sampling of summary statistics with matching methods and importance weighting. In this…

Statistics Theory · Mathematics 2022-06-02 James Sharpnack

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

Computational Complexity · Computer Science 2007-05-23 Harry B. Hunt , Madhav V. Marathe , Venkatesh Radhakrishnan , Richard E. Stearns

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Numerical Analysis · Mathematics 2021-12-14 Boris Kashin , Sergei Konyagin , Vladimir Temlyakov

We address the problem of characterising the compatible tuples of measurements that admit a unique joint measurement. We derive a uniqueness criterion based on the method of perturbations and apply it to show that extremal points of the set…

Quantum Physics · Physics 2019-05-29 Leonardo Guerini , Marcelo Terra Cunha

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

Numerical Analysis · Mathematics 2024-01-29 Maximiliano Frungillo

A cuf space (set, resp.) is a space (set, resp.) which is a countable union of finite subspaces (subsets, resp.). It is proved in $\mathbf{ZF}$ (with the absence of the axiom of choice) that all countable unions of cuf (denumerable, resp.)…

General Topology · Mathematics 2020-04-29 Kyriakos Keremedis , Eliza Wajch

The aim of the paper is to characterize (pre)compactness in the spaces of Lipschitz/H\"older continuous mappings acting from a compact metric space to a normed space. To this end some extensions and generalizations of already existing…

Functional Analysis · Mathematics 2023-06-21 Jacek Gulgowski , Piotr Kasprzak , Piotr Maćkowiak

In a paper published in 2020 in Studia Mathematica, Abrahamsen et al. proved that in the real space $L_1(\mu)$, where $\mu$ is a non-zero $\sigma$-finite (countably additive non-negative) measure, norm-one elements in finite convex…

Functional Analysis · Mathematics 2025-03-13 Rainis Haller , Paavo Kuuseok , Märt Põldvere

The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…

Functional Analysis · Mathematics 2012-11-07 Frank Deutsch , Hein Hundal , Ludmil Zikatanov

We consider a complete metric space $(X,d)$ and a countable number of contractive mappings on $X$, $\mathcal{F}=\{F_i:i\in\mathbb N\}$. We show the existence of a {\em smallest} invariant set (with respect to inclusion) for $\mathcal{F}$.…

Classical Analysis and ODEs · Mathematics 2013-07-04 Maria Fernanda Barrozo , Ursula Molter

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

Logic in Computer Science · Computer Science 2017-06-05 Kei Matsumoto

We consider machine learning in a comparison-based setting where we are given a set of points in a metric space, but we have no access to the actual distances between the points. Instead, we can only ask an oracle whether the distance…

Machine Learning · Statistics 2017-04-06 Siavash Haghiri , Debarghya Ghoshdastidar , Ulrike von Luxburg

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

Functional Analysis · Mathematics 2009-06-12 José R. Morales , Edixon Rojas

In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…

Logic · Mathematics 2025-02-19 Serhii Bardyla , Peter Nyikos , Lyubomyr Zdomskyy

A topological space $X$ is cometrizable if it admits a weaker metrizable topology such that each point $x\in X$ has a (not necessarily open) neighborhood base consisting of metrically closed sets. We study the relation of cometrizable…

General Topology · Mathematics 2020-04-07 Taras Banakh , Yaryna Stelmakh

We study the approximation of non-negative multi-variate couplings in the uniform norm while matching given single-variable marginal constraints.

Probability · Mathematics 2021-08-25 Ugo Bindini , Tapio Rajala

In this paper, we propose to study the following maximum ordinal consensus problem: Suppose we are given a metric system (M, X), which contains k metrics M = {\rho_1,..., \rho_k} defined on the same point set X. We aim to find a maximum…

Computational Complexity · Computer Science 2021-03-03 Dingkang Wang , Yusu Wang

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

Computational Geometry · Computer Science 2013-03-13 Rainer Penninger , Ivo Vigan
‹ Prev 1 3 4 5 6 7 10 Next ›