English
Related papers

Related papers: The (largest) Lebesgue number and its relative ver…

200 papers

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

Combinatorics · Mathematics 2017-11-15 David Ellis , Imre Leader

For a classification problem described by the joint density $P(\omega,x)$, models of $P(\omega\eq\omega'|x,x')$ (the ``Bayesian similarity measure'') have been shown to be an optimal similarity measure for nearest neighbor classification.…

Machine Learning · Computer Science 2007-12-04 Thomas M. Breuel

Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…

Combinatorics · Mathematics 2025-07-21 Ali Ghalavand , Sandi Klavžar , Xueliang Li

We establish the last missing link allowing to describe those complete separable metric spaces $X$ in which the $k$ nearest neighbour classifier is universally consistent, both in combinatorial terms of dimension theory and via a…

Machine Learning · Computer Science 2026-02-09 Vladimir G. Pestov

In a metric space $M=(X,d)$, we say that $v$ is between $u$ and $w$ if $d(u,w)=d(u,v)+d(v,w)$. Taking all triples $\{u,v,w\}$ such that $v$ is between $u$ and $w$, one can associate a 3-uniform hypergraph with each finite metric space $M$.…

Combinatorics · Mathematics 2022-09-08 Vašek Chvátal , Ida Kantor

For a locally pseudocompact space $X$ let [\zeta X=X\cup cl_{\beta X}(\beta X\backslash\upsilon X).] It is proved that $\zeta X$ is the largest (with respect to the standard partial order $\leq$) among all pseudocompactifications of $X$…

General Topology · Mathematics 2015-06-26 M. R. Koushesh

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…

Dynamical Systems · Mathematics 2015-05-11 Henna Koivusalo

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

Complex Variables · Mathematics 2024-11-07 Evgeny Sevost'yanov , Denys Romash , Nataliya Ilkevych

Suppose $a_n$ is a real, nonnegative sequence that does not increase exponentially. For any $p<1$ we contruct a Lebesgue measurable set $E \subseteq \mathbb{R}$ which has measure at least $p$ in any unit interval and which contains no…

Classical Analysis and ODEs · Mathematics 2024-12-18 Mihail N. Kolountzakis , Effie Papageorgiou

Suppose $E, F$ are Borel sets in the plane, $\dim_{\mathcal{H}} E>1$, $\dim_{\mathcal{H}} E+\dim_{\mathcal{H}} F>2$, and $F$ has equal Hausdorff and packing dimension. We prove that there exists $y\in F$ such that the pinned distance set…

Classical Analysis and ODEs · Mathematics 2026-04-28 Bochen Liu

The Levi-Civita field $\mathcal{R}$ is the smallest non-Archimedean ordered field extension of the real numbers that is real closed and Cauchy complete in the topology induced by the order. In this paper we develop a new theory of…

Functional Analysis · Mathematics 2025-06-25 Mateo Restrepo Borrero , Khodr Shamseddine

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

Computational Geometry · Computer Science 2026-04-30 Reilly Browne

A review of the state of the art of the comparison between any two different modes of convergence of sequences of measurable functions is carried out with focus on the algebraic structure of the families under analysis. As a complement of…

Functional Analysis · Mathematics 2026-04-10 L. Bernal-González , M. C. Calderón-Moreno , P. J. Gerlach-Mena , J. A. Prado-Bassas

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

Combinatorics · Mathematics 2018-12-11 William T. Trotter , Bartosz Walczak , Ruidong Wang

We study the subsymmetric basic sequence structure of variable exponent Lebesgue spaces $L_{P}$ built from index functions $P\colon\Omega\to(0,\infty]$ on $\sigma$-finite measure spaces $(\Omega,\Sigma,\mu)$. Specifically, we prove that if…

Functional Analysis · Mathematics 2025-12-23 José L. Ansorena , Glenier Bello

In this paper, we study the uniform random covering problem in general metric space $(X,d)$. Let $\omega=(\omega_n)_{n\in\mathbb N}$ be a sequence of independent identically distributed random variables on $(X,\mu)$, and…

Probability · Mathematics 2026-03-03 Zhang-nan Hu , Bing Li , YiJing Wang

Frechet's classical isometric embedding argument has evolved to become a major tool in the study of metric spaces. An important example of a Frechet embedding is Bourgain's embedding. The authors have recently shown that for every e>0 any…

Metric Geometry · Mathematics 2009-03-23 Yair Batal , Nathan Linial , Manor Mendel , Assaf Naor

The Riemann Mapping Theorem states existence of a conformal homeomorphism $\varphi$ of a simply connected plane domain $\Omega\subset\mathbb C$ with non-empty boundary onto the unit disc $\mathbb D\subset \mathbb C$. In the first part of…

Functional Analysis · Mathematics 2013-05-21 V. Gol'dshtein , A. Ukhlov

We partly extend the localisation technique from convex geometry to the multiple constraints setting. For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$, $m\leq n$, we define and prove the existence of a partition of…

Metric Geometry · Mathematics 2021-08-17 Krzysztof J. Ciosmak

This article provides bounds on the size of a 3-uniform linear hypergraph with restricted matching number and maximum degree. In particular, we show that if a 3-uniform, linear family $\mathcal{F}$ has maximum matching size $\nu$ and…

Combinatorics · Mathematics 2013-04-18 Niraj Khare